/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:00:10,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:00:10,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:00:10,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:00:10,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:00:10,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:00:10,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:00:10,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:00:10,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:00:10,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:00:10,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:00:10,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:00:10,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:00:10,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:00:10,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:00:10,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:00:10,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:00:10,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:00:10,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:00:10,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:00:10,258 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:00:10,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:00:10,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:00:10,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:00:10,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:00:10,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:00:10,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:00:10,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:00:10,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:00:10,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:00:10,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:00:10,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:00:10,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:00:10,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:00:10,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:00:10,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:00:10,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:00:10,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:00:10,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:00:10,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:00:10,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:00:10,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:00:10,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:00:10,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:00:10,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:00:10,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:00:10,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:00:10,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:00:10,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:00:10,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:00:10,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:00:10,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:00:10,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:00:10,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:00:10,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:00:10,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:00:10,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:00:10,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:00:10,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:10,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:00:10,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:00:10,297 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:00:10,297 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:00:10,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:00:10,297 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:00:10,297 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:00:10,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:00:10,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:00:10,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:00:10,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:00:10,520 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:00:10,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-28 09:00:10,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6955000c/8af8d19f096b494f8c0732ee1576b30c/FLAGa413b5a45 [2022-04-28 09:00:10,868 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:00:10,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-28 09:00:10,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6955000c/8af8d19f096b494f8c0732ee1576b30c/FLAGa413b5a45 [2022-04-28 09:00:11,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6955000c/8af8d19f096b494f8c0732ee1576b30c [2022-04-28 09:00:11,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:00:11,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:00:11,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:11,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:00:11,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:00:11,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b027b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11, skipping insertion in model container [2022-04-28 09:00:11,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:00:11,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:00:11,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c[323,336] [2022-04-28 09:00:11,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:11,578 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:00:11,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c[323,336] [2022-04-28 09:00:11,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:11,617 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:00:11,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11 WrapperNode [2022-04-28 09:00:11,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:11,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:00:11,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:00:11,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:00:11,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:00:11,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:00:11,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:00:11,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:00:11,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:11,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:00:11,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:00:11,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:00:11,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:00:11,732 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:00:11,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:00:11,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:00:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:00:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:00:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:00:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:00:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:00:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:00:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:00:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:00:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:00:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:00:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:00:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:00:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:00:11,786 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:00:11,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:00:12,080 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:00:12,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:00:12,085 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-28 09:00:12,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:12 BoogieIcfgContainer [2022-04-28 09:00:12,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:00:12,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:00:12,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:00:12,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:00:12,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:00:11" (1/3) ... [2022-04-28 09:00:12,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569fb32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:12, skipping insertion in model container [2022-04-28 09:00:12,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (2/3) ... [2022-04-28 09:00:12,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569fb32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:12, skipping insertion in model container [2022-04-28 09:00:12,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:12" (3/3) ... [2022-04-28 09:00:12,101 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2022-04-28 09:00:12,112 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:00:12,112 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:00:12,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:00:12,153 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@278f7280, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@639b004f [2022-04-28 09:00:12,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:00:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:00:12,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:12,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:12,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 1 times [2022-04-28 09:00:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [832011987] [2022-04-28 09:00:12,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 2 times [2022-04-28 09:00:12,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:12,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742078418] [2022-04-28 09:00:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {38#true} is VALID [2022-04-28 09:00:12,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-28 09:00:12,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-28 09:00:12,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:12,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {38#true} is VALID [2022-04-28 09:00:12,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-28 09:00:12,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-28 09:00:12,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret22 := main(); {38#true} is VALID [2022-04-28 09:00:12,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {38#true} is VALID [2022-04-28 09:00:12,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-04-28 09:00:12,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-28 09:00:12,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-28 09:00:12,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-28 09:00:12,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-28 09:00:12,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-28 09:00:12,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {39#false} is VALID [2022-04-28 09:00:12,446 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {39#false} is VALID [2022-04-28 09:00:12,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-28 09:00:12,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-28 09:00:12,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-28 09:00:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:12,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:12,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742078418] [2022-04-28 09:00:12,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742078418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:12,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:12,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [832011987] [2022-04-28 09:00:12,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [832011987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130856644] [2022-04-28 09:00:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:00:12,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:12,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:12,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:00:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:00:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:00:12,524 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,634 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-28 09:00:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:00:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:00:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-28 09:00:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-28 09:00:12,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2022-04-28 09:00:12,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,753 INFO L225 Difference]: With dead ends: 61 [2022-04-28 09:00:12,753 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:00:12,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:00:12,760 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:12,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:00:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 09:00:12,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:12,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:12,793 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:12,794 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,799 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 09:00:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 09:00:12,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 09:00:12,801 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 09:00:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,804 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 09:00:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 09:00:12,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:12,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-28 09:00:12,809 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2022-04-28 09:00:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:12,810 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-28 09:00:12,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:12,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-28 09:00:12,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 09:00:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:00:12,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:12,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:12,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:00:12,855 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:12,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 1 times [2022-04-28 09:00:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29007237] [2022-04-28 09:00:12,856 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 2 times [2022-04-28 09:00:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:12,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601013303] [2022-04-28 09:00:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {288#true} is VALID [2022-04-28 09:00:12,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-28 09:00:12,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-28 09:00:12,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:12,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {288#true} is VALID [2022-04-28 09:00:12,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-28 09:00:12,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #107#return; {288#true} is VALID [2022-04-28 09:00:12,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret22 := main(); {288#true} is VALID [2022-04-28 09:00:12,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:12,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {289#false} is VALID [2022-04-28 09:00:12,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-28 09:00:12,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#false} assume !(~i~0 < ~nodecount~0); {289#false} is VALID [2022-04-28 09:00:12,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-28 09:00:12,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#false} assume !(~i~0 < ~edgecount~0); {289#false} is VALID [2022-04-28 09:00:12,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} ~i~0 := 0; {289#false} is VALID [2022-04-28 09:00:12,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {289#false} is VALID [2022-04-28 09:00:12,969 INFO L272 TraceCheckUtils]: 13: Hoare triple {289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {289#false} is VALID [2022-04-28 09:00:12,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2022-04-28 09:00:12,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2022-04-28 09:00:12,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-28 09:00:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:12,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:12,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601013303] [2022-04-28 09:00:12,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601013303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:12,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:12,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29007237] [2022-04-28 09:00:12,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29007237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582014410] [2022-04-28 09:00:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:00:12,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:12,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:12,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:00:12,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:00:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:00:12,985 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,108 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-28 09:00:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:00:13,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:00:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-28 09:00:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-28 09:00:13,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-28 09:00:13,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,176 INFO L225 Difference]: With dead ends: 54 [2022-04-28 09:00:13,176 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 09:00:13,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:00:13,177 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:13,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 09:00:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-28 09:00:13,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:13,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,184 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,185 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,186 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-28 09:00:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-28 09:00:13,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:13,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:13,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 09:00:13,188 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 09:00:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,191 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-28 09:00:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-28 09:00:13,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:13,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:13,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:13,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-04-28 09:00:13,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2022-04-28 09:00:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:13,193 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-04-28 09:00:13,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 37 transitions. [2022-04-28 09:00:13,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-28 09:00:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:00:13,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:13,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:13,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:00:13,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:13,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 1 times [2022-04-28 09:00:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722042696] [2022-04-28 09:00:13,245 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:13,245 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 2 times [2022-04-28 09:00:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:13,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606954757] [2022-04-28 09:00:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {535#true} is VALID [2022-04-28 09:00:13,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-28 09:00:13,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-28 09:00:13,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:13,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {535#true} is VALID [2022-04-28 09:00:13,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-28 09:00:13,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {535#true} {535#true} #107#return; {535#true} is VALID [2022-04-28 09:00:13,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {535#true} call #t~ret22 := main(); {535#true} is VALID [2022-04-28 09:00:13,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:00:13,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:00:13,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:00:13,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:00:13,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {540#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:00:13,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {541#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:13,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {536#false} is VALID [2022-04-28 09:00:13,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-28 09:00:13,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#false} assume !(~i~0 < ~edgecount~0); {536#false} is VALID [2022-04-28 09:00:13,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#false} ~i~0 := 0; {536#false} is VALID [2022-04-28 09:00:13,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {536#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {536#false} is VALID [2022-04-28 09:00:13,343 INFO L272 TraceCheckUtils]: 16: Hoare triple {536#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {536#false} is VALID [2022-04-28 09:00:13,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#false} ~cond := #in~cond; {536#false} is VALID [2022-04-28 09:00:13,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {536#false} assume 0 == ~cond; {536#false} is VALID [2022-04-28 09:00:13,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {536#false} assume !false; {536#false} is VALID [2022-04-28 09:00:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:00:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:13,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606954757] [2022-04-28 09:00:13,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606954757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:13,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:13,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722042696] [2022-04-28 09:00:13,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722042696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77622093] [2022-04-28 09:00:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:13,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 09:00:13,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:13,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:00:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:00:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:00:13,375 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,563 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-28 09:00:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:13,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 09:00:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-28 09:00:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-28 09:00:13,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-28 09:00:13,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,636 INFO L225 Difference]: With dead ends: 61 [2022-04-28 09:00:13,636 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 09:00:13,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:13,639 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:13,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 29 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 09:00:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-04-28 09:00:13,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:13,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,652 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,652 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,655 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-28 09:00:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 09:00:13,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:13,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:13,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-04-28 09:00:13,662 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-04-28 09:00:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,668 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-28 09:00:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 09:00:13,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:13,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:13,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:13,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-28 09:00:13,671 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2022-04-28 09:00:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:13,673 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-28 09:00:13,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-28 09:00:13,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-28 09:00:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:00:13,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:13,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:13,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:00:13,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:13,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 1 times [2022-04-28 09:00:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [668873735] [2022-04-28 09:00:13,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:13,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 2 times [2022-04-28 09:00:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210723128] [2022-04-28 09:00:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {827#true} is VALID [2022-04-28 09:00:13,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 09:00:13,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-28 09:00:13,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:13,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {827#true} is VALID [2022-04-28 09:00:13,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 09:00:13,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #107#return; {827#true} is VALID [2022-04-28 09:00:13,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret22 := main(); {827#true} is VALID [2022-04-28 09:00:13,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:13,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:13,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:13,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:13,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:13,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {832#(<= 20 main_~edgecount~0)} ~i~0 := 0; {832#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:13,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {833#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:13,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {833#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {828#false} is VALID [2022-04-28 09:00:13,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {828#false} is VALID [2022-04-28 09:00:13,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#false} assume !(~i~0 < ~nodecount~0); {828#false} is VALID [2022-04-28 09:00:13,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-28 09:00:13,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#false} assume !(~i~0 < ~edgecount~0); {828#false} is VALID [2022-04-28 09:00:13,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {828#false} ~i~0 := 0; {828#false} is VALID [2022-04-28 09:00:13,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {828#false} is VALID [2022-04-28 09:00:13,790 INFO L272 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {828#false} is VALID [2022-04-28 09:00:13,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2022-04-28 09:00:13,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0 == ~cond; {828#false} is VALID [2022-04-28 09:00:13,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-28 09:00:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:00:13,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210723128] [2022-04-28 09:00:13,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210723128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:13,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [668873735] [2022-04-28 09:00:13,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [668873735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:13,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750610017] [2022-04-28 09:00:13,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 09:00:13,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:13,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:00:13,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:00:13,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:00:13,813 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,947 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-28 09:00:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:13,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 09:00:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 09:00:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 09:00:13,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 09:00:13,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:14,000 INFO L225 Difference]: With dead ends: 55 [2022-04-28 09:00:14,000 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 09:00:14,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:14,002 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:14,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 09:00:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-28 09:00:14,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:14,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,023 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,023 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:14,024 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 09:00:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 09:00:14,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:14,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:14,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-28 09:00:14,025 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-28 09:00:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:14,026 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 09:00:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 09:00:14,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:14,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:14,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:14,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-28 09:00:14,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2022-04-28 09:00:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:14,027 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-28 09:00:14,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:14,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-28 09:00:14,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 09:00:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 09:00:14,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:14,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:14,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:00:14,067 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:14,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:14,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 1 times [2022-04-28 09:00:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:14,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81625535] [2022-04-28 09:00:14,070 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:14,071 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 2 times [2022-04-28 09:00:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:14,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511763241] [2022-04-28 09:00:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:14,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:14,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1087#true} is VALID [2022-04-28 09:00:14,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-28 09:00:14,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-28 09:00:14,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:14,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {1094#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1087#true} is VALID [2022-04-28 09:00:14,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2022-04-28 09:00:14,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1087#true} #107#return; {1087#true} is VALID [2022-04-28 09:00:14,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {1087#true} call #t~ret22 := main(); {1087#true} is VALID [2022-04-28 09:00:14,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {1087#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {1092#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {1092#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1092#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:14,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1093#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:14,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1088#false} is VALID [2022-04-28 09:00:14,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#false} ~i~0 := 0; {1088#false} is VALID [2022-04-28 09:00:14,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1088#false} is VALID [2022-04-28 09:00:14,152 INFO L272 TraceCheckUtils]: 22: Hoare triple {1088#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1088#false} is VALID [2022-04-28 09:00:14,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2022-04-28 09:00:14,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2022-04-28 09:00:14,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2022-04-28 09:00:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:14,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511763241] [2022-04-28 09:00:14,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511763241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:14,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:14,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:14,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:14,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81625535] [2022-04-28 09:00:14,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81625535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:14,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:14,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152949588] [2022-04-28 09:00:14,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 09:00:14,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:14,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:14,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:14,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:00:14,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:14,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:00:14,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:00:14,174 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:14,329 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-28 09:00:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:14,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 09:00:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 09:00:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 09:00:14,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 09:00:14,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:14,381 INFO L225 Difference]: With dead ends: 58 [2022-04-28 09:00:14,381 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 09:00:14,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:14,382 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:14,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 29 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 09:00:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-04-28 09:00:14,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:14,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,397 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,397 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:14,398 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 09:00:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 09:00:14,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:14,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:14,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-28 09:00:14,399 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-28 09:00:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:14,400 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 09:00:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 09:00:14,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:14,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:14,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:14,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-28 09:00:14,401 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2022-04-28 09:00:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:14,402 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-28 09:00:14,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:14,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-28 09:00:14,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-28 09:00:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:00:14,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:14,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:14,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 09:00:14,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:14,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 1 times [2022-04-28 09:00:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:14,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [51042875] [2022-04-28 09:00:14,445 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:14,445 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 2 times [2022-04-28 09:00:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:14,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473963622] [2022-04-28 09:00:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:14,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-28 09:00:14,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 09:00:14,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-28 09:00:14,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:14,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-28 09:00:14,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 09:00:14,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-28 09:00:14,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-28 09:00:14,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:14,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:14,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1385#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {1385#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1380#false} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1380#false} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1380#false} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1380#false} is VALID [2022-04-28 09:00:14,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#false} assume !(~j~0 < ~edgecount~0); {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1380#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#false} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-28 09:00:14,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-28 09:00:14,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-28 09:00:14,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-28 09:00:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:14,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473963622] [2022-04-28 09:00:14,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473963622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:14,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836220720] [2022-04-28 09:00:14,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:14,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:14,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:14,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:14,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:00:14,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:14,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:14,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:14,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:14,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-28 09:00:14,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-28 09:00:14,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 09:00:14,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-28 09:00:14,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-28 09:00:14,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:14,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:14,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:14,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {1405#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:14,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {1405#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1405#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:14,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {1405#(<= 5 main_~nodecount~0)} ~i~0 := 0; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:14,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:14,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:14,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:14,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:14,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:14,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {1421#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1440#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:14,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-28 09:00:14,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-28 09:00:14,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-28 09:00:14,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-28 09:00:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:14,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:14,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-28 09:00:14,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-28 09:00:14,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-28 09:00:14,999 INFO L272 TraceCheckUtils]: 25: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-28 09:00:14,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-28 09:00:14,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-28 09:00:14,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-28 09:00:15,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1380#false} is VALID [2022-04-28 09:00:15,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1380#false} is VALID [2022-04-28 09:00:15,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-28 09:00:15,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-28 09:00:15,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {1510#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1380#false} is VALID [2022-04-28 09:00:15,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1510#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:00:15,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:15,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:15,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:15,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:15,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {1514#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:15,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {1533#(< 1 main_~nodecount~0)} ~i~0 := 0; {1514#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:15,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {1533#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:15,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {1533#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:15,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {1533#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:15,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:15,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1533#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:15,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-28 09:00:15,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #107#return; {1379#true} is VALID [2022-04-28 09:00:15,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-28 09:00:15,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-28 09:00:15,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-28 09:00:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:15,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836220720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:15,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:15,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-28 09:00:15,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:15,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [51042875] [2022-04-28 09:00:15,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [51042875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:15,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:15,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237444993] [2022-04-28 09:00:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:15,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 09:00:15,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:15,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:15,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:00:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:00:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:00:15,034 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:15,193 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-28 09:00:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:15,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 09:00:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 09:00:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 09:00:15,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 09:00:15,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:15,247 INFO L225 Difference]: With dead ends: 63 [2022-04-28 09:00:15,247 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 09:00:15,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:00:15,248 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:15,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 43 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 09:00:15,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-04-28 09:00:15,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:15,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:15,278 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:15,278 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:15,281 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 09:00:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-28 09:00:15,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:15,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:15,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-28 09:00:15,282 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-28 09:00:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:15,283 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 09:00:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-28 09:00:15,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:15,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:15,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:15,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-28 09:00:15,285 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29 [2022-04-28 09:00:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:15,285 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-28 09:00:15,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-28 09:00:15,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-28 09:00:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 09:00:15,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:15,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:15,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:15,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 09:00:15,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 3 times [2022-04-28 09:00:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:15,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [40399028] [2022-04-28 09:00:15,548 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:15,548 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218863, now seen corresponding path program 4 times [2022-04-28 09:00:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:15,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856686656] [2022-04-28 09:00:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:15,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-28 09:00:15,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-28 09:00:15,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-28 09:00:15,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {1848#true} call ULTIMATE.init(); {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:15,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-28 09:00:15,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-28 09:00:15,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-28 09:00:15,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-28 09:00:15,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:15,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:15,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1853#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:15,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {1853#(and (= main_~source~0 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-28 09:00:15,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-28 09:00:15,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {1849#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {1849#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {1849#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {1849#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1849#false} is VALID [2022-04-28 09:00:15,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {1849#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {1849#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {1849#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L272 TraceCheckUtils]: 28: Hoare triple {1849#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-28 09:00:15,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-28 09:00:15,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-28 09:00:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:15,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856686656] [2022-04-28 09:00:15,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856686656] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:15,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488838517] [2022-04-28 09:00:15,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:15,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:15,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:15,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:15,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:00:15,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:15,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:15,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 09:00:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:15,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:15,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {1848#true} call ULTIMATE.init(); {1848#true} is VALID [2022-04-28 09:00:15,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1848#true} is VALID [2022-04-28 09:00:15,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume true; {1848#true} is VALID [2022-04-28 09:00:15,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1848#true} {1848#true} #107#return; {1848#true} is VALID [2022-04-28 09:00:15,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {1848#true} call #t~ret22 := main(); {1848#true} is VALID [2022-04-28 09:00:15,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1848#true} is VALID [2022-04-28 09:00:15,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#true} assume !!(~i~0 < ~nodecount~0); {1848#true} is VALID [2022-04-28 09:00:15,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1880#(<= main_~source~0 main_~i~0)} is VALID [2022-04-28 09:00:15,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1880#(<= main_~source~0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1884#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-28 09:00:15,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {1884#(<= (+ main_~source~0 1) main_~i~0)} assume !!(~i~0 < ~nodecount~0); {1884#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-28 09:00:15,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {1884#(<= (+ main_~source~0 1) main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1849#false} is VALID [2022-04-28 09:00:15,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-28 09:00:15,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {1849#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {1849#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {1849#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {1849#false} assume !(~j~0 < ~edgecount~0); {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {1849#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {1849#false} assume !(~i~0 < ~nodecount~0); {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {1849#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {1849#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {1849#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {1849#false} assume !(~i~0 < ~edgecount~0); {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {1849#false} ~i~0 := 0; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {1849#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L272 TraceCheckUtils]: 28: Hoare triple {1849#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {1849#false} ~cond := #in~cond; {1849#false} is VALID [2022-04-28 09:00:15,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {1849#false} assume 0 == ~cond; {1849#false} is VALID [2022-04-28 09:00:15,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-04-28 09:00:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:15,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:00:15,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488838517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:15,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:00:15,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-28 09:00:15,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:15,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [40399028] [2022-04-28 09:00:15,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [40399028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:15,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:15,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18493698] [2022-04-28 09:00:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 09:00:15,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:15,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:15,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:00:15,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:15,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:00:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:15,847 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:15,940 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 09:00:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:00:15,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 09:00:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 09:00:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 09:00:15,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-28 09:00:16,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:16,041 INFO L225 Difference]: With dead ends: 65 [2022-04-28 09:00:16,041 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 09:00:16,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:16,042 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:16,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 09:00:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 09:00:16,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:16,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:16,065 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:16,065 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:16,066 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-28 09:00:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-28 09:00:16,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:16,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:16,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-28 09:00:16,067 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-28 09:00:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:16,067 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-28 09:00:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-28 09:00:16,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:16,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:16,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:16,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-28 09:00:16,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 32 [2022-04-28 09:00:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:16,069 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-28 09:00:16,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:16,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 43 transitions. [2022-04-28 09:00:16,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 09:00:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 09:00:16,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:16,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:16,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:16,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-28 09:00:16,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:16,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 1 times [2022-04-28 09:00:16,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:16,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111244658] [2022-04-28 09:00:16,332 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:16,332 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1271364145, now seen corresponding path program 2 times [2022-04-28 09:00:16,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:16,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485373029] [2022-04-28 09:00:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:16,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-28 09:00:16,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-28 09:00:16,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-28 09:00:16,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:16,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {2241#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-28 09:00:16,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-28 09:00:16,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-28 09:00:16,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-28 09:00:16,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:16,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:16,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:16,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {2238#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:16,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:16,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:16,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {2239#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2240#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:00:16,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {2240#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-28 09:00:16,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,428 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-28 09:00:16,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-28 09:00:16,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-28 09:00:16,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-28 09:00:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:16,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:16,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485373029] [2022-04-28 09:00:16,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485373029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:16,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673861130] [2022-04-28 09:00:16,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:16,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:16,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:00:16,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:16,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:16,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:00:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:16,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-28 09:00:16,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-28 09:00:16,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-28 09:00:16,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-28 09:00:16,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-28 09:00:16,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:16,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:16,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:16,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:16,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:16,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:16,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {2270#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:16,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-28 09:00:16,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-28 09:00:16,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-28 09:00:16,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-28 09:00:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:16,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:16,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#false} assume !false; {2234#false} is VALID [2022-04-28 09:00:16,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#false} assume 0 == ~cond; {2234#false} is VALID [2022-04-28 09:00:16,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#false} ~cond := #in~cond; {2234#false} is VALID [2022-04-28 09:00:16,805 INFO L272 TraceCheckUtils]: 28: Hoare triple {2234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2234#false} is VALID [2022-04-28 09:00:16,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#false} assume !(~i~0 < ~edgecount~0); {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#false} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#false} assume !(~j~0 < ~edgecount~0); {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#false} ~i~0 := 0; {2234#false} is VALID [2022-04-28 09:00:16,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {2398#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2234#false} is VALID [2022-04-28 09:00:16,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2398#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:00:16,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:16,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2402#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:16,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2402#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:16,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:00:16,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:00:16,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2412#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:00:16,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} call #t~ret22 := main(); {2233#true} is VALID [2022-04-28 09:00:16,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} #107#return; {2233#true} is VALID [2022-04-28 09:00:16,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} assume true; {2233#true} is VALID [2022-04-28 09:00:16,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2233#true} is VALID [2022-04-28 09:00:16,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} call ULTIMATE.init(); {2233#true} is VALID [2022-04-28 09:00:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:16,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673861130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:16,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:16,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-28 09:00:16,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:16,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111244658] [2022-04-28 09:00:16,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111244658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:16,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:16,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548052495] [2022-04-28 09:00:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:16,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 09:00:16,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:16,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:16,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:16,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:00:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:16,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:00:16,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:00:16,834 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:17,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:17,050 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 09:00:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:00:17,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 09:00:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 09:00:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 09:00:17,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-28 09:00:17,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:17,100 INFO L225 Difference]: With dead ends: 66 [2022-04-28 09:00:17,101 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 09:00:17,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=123, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:00:17,101 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:17,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 09:00:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-28 09:00:17,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:17,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,145 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,145 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:17,147 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-28 09:00:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-28 09:00:17,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:17,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:17,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-28 09:00:17,148 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-28 09:00:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:17,149 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-28 09:00:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-28 09:00:17,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:17,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:17,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:17,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-04-28 09:00:17,150 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2022-04-28 09:00:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:17,151 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-04-28 09:00:17,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:17,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 46 transitions. [2022-04-28 09:00:17,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-28 09:00:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 09:00:17,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:17,200 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:17,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:17,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:17,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 3 times [2022-04-28 09:00:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:17,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691305847] [2022-04-28 09:00:17,427 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:17,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1380320561, now seen corresponding path program 4 times [2022-04-28 09:00:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:17,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047861432] [2022-04-28 09:00:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:17,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:17,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-28 09:00:17,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-28 09:00:17,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-28 09:00:17,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:17,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {2750#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-28 09:00:17,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-28 09:00:17,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-28 09:00:17,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-28 09:00:17,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:17,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:17,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:17,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {2746#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:17,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:17,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:17,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {2747#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:00:17,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0); {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:00:17,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:00:17,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {2748#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2749#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {2749#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {2742#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {2742#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {2742#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {2742#false} assume !(~j~0 < ~edgecount~0); {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {2742#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {2742#false} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-28 09:00:17,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-28 09:00:17,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-28 09:00:17,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-28 09:00:17,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-28 09:00:17,531 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-28 09:00:17,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-28 09:00:17,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-28 09:00:17,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-28 09:00:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:17,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:17,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047861432] [2022-04-28 09:00:17,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047861432] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:17,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918048593] [2022-04-28 09:00:17,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:17,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:17,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:17,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:17,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:00:17,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:17,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:17,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:17,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:17,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-28 09:00:17,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-28 09:00:17,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-28 09:00:17,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-28 09:00:17,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-28 09:00:17,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2769#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {2769#(<= 5 main_~nodecount~0)} ~i~0 := 0; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:17,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:17,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:17,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:17,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:17,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:17,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {2803#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2822#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {2822#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-28 09:00:17,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-28 09:00:17,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-28 09:00:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 09:00:17,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:17,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {2742#false} assume !false; {2742#false} is VALID [2022-04-28 09:00:17,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#false} assume 0 == ~cond; {2742#false} is VALID [2022-04-28 09:00:17,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#false} ~cond := #in~cond; {2742#false} is VALID [2022-04-28 09:00:17,962 INFO L272 TraceCheckUtils]: 31: Hoare triple {2742#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2742#false} is VALID [2022-04-28 09:00:17,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {2742#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-28 09:00:17,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {2742#false} assume !(~i~0 < ~edgecount~0); {2742#false} is VALID [2022-04-28 09:00:17,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {2742#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2742#false} is VALID [2022-04-28 09:00:17,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {2742#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2742#false} is VALID [2022-04-28 09:00:17,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {2742#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2742#false} is VALID [2022-04-28 09:00:17,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {2742#false} ~i~0 := 0; {2742#false} is VALID [2022-04-28 09:00:17,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {2892#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2742#false} is VALID [2022-04-28 09:00:17,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2892#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:17,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:17,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:17,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:17,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {2896#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:17,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {2915#(< 1 main_~nodecount~0)} ~i~0 := 0; {2896#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:17,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:17,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:18,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {2915#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:18,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {2915#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:18,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {2915#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:18,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {2741#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2915#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:18,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {2741#true} call #t~ret22 := main(); {2741#true} is VALID [2022-04-28 09:00:18,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2741#true} {2741#true} #107#return; {2741#true} is VALID [2022-04-28 09:00:18,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {2741#true} assume true; {2741#true} is VALID [2022-04-28 09:00:18,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2741#true} is VALID [2022-04-28 09:00:18,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {2741#true} call ULTIMATE.init(); {2741#true} is VALID [2022-04-28 09:00:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 09:00:18,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918048593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:18,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:18,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-28 09:00:18,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:18,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691305847] [2022-04-28 09:00:18,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691305847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:18,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:18,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:00:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699421545] [2022-04-28 09:00:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 09:00:18,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:18,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:18,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:18,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:00:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:00:18,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:00:18,154 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:18,378 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 09:00:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:00:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 09:00:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-28 09:00:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-28 09:00:18,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-28 09:00:18,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:18,443 INFO L225 Difference]: With dead ends: 69 [2022-04-28 09:00:18,443 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 09:00:18,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:00:18,444 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:18,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 43 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 09:00:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-28 09:00:18,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:18,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:18,498 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:18,498 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:18,499 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 09:00:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 09:00:18,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:18,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:18,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-04-28 09:00:18,500 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-04-28 09:00:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:18,500 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 09:00:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 09:00:18,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:18,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:18,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:18,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-28 09:00:18,501 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 35 [2022-04-28 09:00:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:18,502 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-28 09:00:18,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:18,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2022-04-28 09:00:18,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-28 09:00:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 09:00:18,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:18,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:18,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:18,829 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 5 times [2022-04-28 09:00:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:18,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241400211] [2022-04-28 09:00:18,833 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:18,833 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 6 times [2022-04-28 09:00:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119260159] [2022-04-28 09:00:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:18,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:18,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-28 09:00:18,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-28 09:00:18,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-28 09:00:18,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:18,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {3298#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-28 09:00:18,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-28 09:00:18,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-28 09:00:18,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-28 09:00:18,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:18,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:18,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:18,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {3293#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:18,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:18,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:18,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {3294#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:00:18,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0); {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:00:18,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:00:18,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:00:18,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0); {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:00:18,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:00:18,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {3296#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3297#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:00:18,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {3297#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-28 09:00:18,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {3289#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {3289#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#false} assume !(~j~0 < ~edgecount~0); {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#false} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-28 09:00:18,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-28 09:00:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:00:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119260159] [2022-04-28 09:00:18,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119260159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482130878] [2022-04-28 09:00:18,932 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:18,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:18,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:18,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 09:00:19,009 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:19,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:19,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:19,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:19,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-28 09:00:19,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-28 09:00:19,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-28 09:00:19,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-28 09:00:19,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-28 09:00:19,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {3317#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {3317#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3317#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {3317#(<= 5 main_~nodecount~0)} ~i~0 := 0; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:19,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:19,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:19,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:19,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:19,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:19,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {3360#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3379#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {3379#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-28 09:00:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 09:00:19,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:19,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2022-04-28 09:00:19,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {3289#false} assume 0 == ~cond; {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {3289#false} ~cond := #in~cond; {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L272 TraceCheckUtils]: 34: Hoare triple {3289#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {3289#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#false} assume !(~i~0 < ~edgecount~0); {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {3289#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {3289#false} ~i~0 := 0; {3289#false} is VALID [2022-04-28 09:00:19,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {3449#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3289#false} is VALID [2022-04-28 09:00:19,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3449#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:19,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:19,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:19,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:19,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {3453#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:19,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {3472#(< 1 main_~nodecount~0)} ~i~0 := 0; {3453#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:19,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {3472#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {3472#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {3472#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {3288#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3472#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:19,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {3288#true} call #t~ret22 := main(); {3288#true} is VALID [2022-04-28 09:00:19,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3288#true} {3288#true} #107#return; {3288#true} is VALID [2022-04-28 09:00:19,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#true} assume true; {3288#true} is VALID [2022-04-28 09:00:19,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {3288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3288#true} is VALID [2022-04-28 09:00:19,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2022-04-28 09:00:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 09:00:19,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482130878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:19,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:19,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-28 09:00:19,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:19,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241400211] [2022-04-28 09:00:19,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241400211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:19,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:19,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937529921] [2022-04-28 09:00:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:00:19,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:19,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:19,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:19,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:00:19,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:19,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:00:19,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:19,370 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,627 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-28 09:00:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:00:19,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:00:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-28 09:00:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-28 09:00:19,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-28 09:00:19,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:19,684 INFO L225 Difference]: With dead ends: 72 [2022-04-28 09:00:19,684 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 09:00:19,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:00:19,685 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:19,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 43 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 09:00:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-28 09:00:19,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:19,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,724 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,724 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,725 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 09:00:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-28 09:00:19,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:19,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:19,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-28 09:00:19,726 INFO L87 Difference]: Start difference. First operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-28 09:00:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,726 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 09:00:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-28 09:00:19,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:19,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:19,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:19,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-28 09:00:19,727 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 38 [2022-04-28 09:00:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:19,728 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-28 09:00:19,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:19,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 52 transitions. [2022-04-28 09:00:19,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-28 09:00:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 09:00:19,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:19,793 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:19,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:19,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 09:00:19,994 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 7 times [2022-04-28 09:00:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:19,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498358313] [2022-04-28 09:00:19,998 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:19,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 8 times [2022-04-28 09:00:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:19,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998890794] [2022-04-28 09:00:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-28 09:00:20,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-28 09:00:20,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-28 09:00:20,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:20,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {3882#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-28 09:00:20,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-28 09:00:20,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-28 09:00:20,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-28 09:00:20,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:20,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:20,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:20,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {3880#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3881#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:20,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {3881#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {3875#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {3875#false} assume !(~i~0 < ~nodecount~0); {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {3875#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {3875#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {3875#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {3875#false} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-28 09:00:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:20,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998890794] [2022-04-28 09:00:20,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998890794] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:20,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491464873] [2022-04-28 09:00:20,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:20,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:20,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:20,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 09:00:20,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:20,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:20,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:20,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-28 09:00:20,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-28 09:00:20,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-28 09:00:20,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-28 09:00:20,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-28 09:00:20,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3879#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {3879#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:20,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:20,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:20,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {3976#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3986#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:20,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {3986#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-28 09:00:20,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-28 09:00:20,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-28 09:00:20,368 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-28 09:00:20,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-28 09:00:20,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-28 09:00:20,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-28 09:00:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 09:00:20,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:20,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-04-28 09:00:20,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {3875#false} assume 0 == ~cond; {3875#false} is VALID [2022-04-28 09:00:20,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {3875#false} ~cond := #in~cond; {3875#false} is VALID [2022-04-28 09:00:20,519 INFO L272 TraceCheckUtils]: 37: Hoare triple {3875#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3875#false} is VALID [2022-04-28 09:00:20,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {3875#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3875#false} is VALID [2022-04-28 09:00:20,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {3875#false} ~i~0 := 0; {3875#false} is VALID [2022-04-28 09:00:20,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {4026#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {3875#false} is VALID [2022-04-28 09:00:20,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4026#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:20,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {4030#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:20,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {4040#(< 1 main_~edgecount~0)} ~i~0 := 0; {4030#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:20,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {4040#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {4040#(< 1 main_~edgecount~0)} ~i~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {4040#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {4040#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {3874#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4040#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:20,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {3874#true} call #t~ret22 := main(); {3874#true} is VALID [2022-04-28 09:00:20,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #107#return; {3874#true} is VALID [2022-04-28 09:00:20,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-04-28 09:00:20,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3874#true} is VALID [2022-04-28 09:00:20,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3874#true} is VALID [2022-04-28 09:00:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 09:00:20,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491464873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:20,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:20,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-04-28 09:00:20,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:20,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498358313] [2022-04-28 09:00:20,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498358313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:20,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:20,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144083801] [2022-04-28 09:00:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:20,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 09:00:20,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:20,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:20,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:00:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:00:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:00:20,557 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:20,796 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-28 09:00:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:00:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 09:00:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 09:00:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 09:00:20,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-28 09:00:20,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:20,846 INFO L225 Difference]: With dead ends: 73 [2022-04-28 09:00:20,846 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 09:00:20,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:20,847 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:20,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 09:00:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-04-28 09:00:20,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:20,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,905 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,905 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:20,906 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 09:00:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 09:00:20,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:20,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:20,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-04-28 09:00:20,907 INFO L87 Difference]: Start difference. First operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-04-28 09:00:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:20,907 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 09:00:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 09:00:20,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:20,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:20,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:20,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-04-28 09:00:20,908 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 41 [2022-04-28 09:00:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:20,908 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-04-28 09:00:20,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:20,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 56 transitions. [2022-04-28 09:00:20,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-28 09:00:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 09:00:20,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:20,970 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:20,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 09:00:21,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:21,170 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:21,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 9 times [2022-04-28 09:00:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:21,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533823831] [2022-04-28 09:00:21,174 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:21,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1307195270, now seen corresponding path program 10 times [2022-04-28 09:00:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:21,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211841463] [2022-04-28 09:00:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:21,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-28 09:00:21,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:21,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-28 09:00:21,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:21,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {4494#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-28 09:00:21,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:21,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-28 09:00:21,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-28 09:00:21,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {4490#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {4490#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4490#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {4490#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:21,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:21,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:21,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {4491#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:21,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:21,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:21,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {4492#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4493#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:21,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {4493#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4486#false} is VALID [2022-04-28 09:00:21,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {4486#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4486#false} is VALID [2022-04-28 09:00:21,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#false} assume !(~i~0 < ~nodecount~0); {4486#false} is VALID [2022-04-28 09:00:21,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-28 09:00:21,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {4486#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {4486#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {4486#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {4486#false} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-28 09:00:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:21,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211841463] [2022-04-28 09:00:21,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211841463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890610458] [2022-04-28 09:00:21,296 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:21,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:21,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:21,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:21,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 09:00:21,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:21,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:21,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:00:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:21,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:21,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-28 09:00:21,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-28 09:00:21,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:21,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-28 09:00:21,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4567#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:21,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {4567#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4567#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:21,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {4567#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4567#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:21,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {4567#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4577#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:21,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {4577#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {4581#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(< 1 main_~edgecount~0)} ~i~0 := 0; {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-28 09:00:21,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-28 09:00:21,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} is VALID [2022-04-28 09:00:21,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {4600#(and (<= main_~i~0 0) (< 1 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4610#(and (<= main_~i~0 1) (< 1 main_~edgecount~0))} is VALID [2022-04-28 09:00:21,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#(and (<= main_~i~0 1) (< 1 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-28 09:00:21,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-28 09:00:21,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-28 09:00:21,570 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-28 09:00:21,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-28 09:00:21,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-28 09:00:21,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-28 09:00:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:21,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:21,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-28 09:00:21,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {4486#false} assume 0 == ~cond; {4486#false} is VALID [2022-04-28 09:00:21,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {4486#false} ~cond := #in~cond; {4486#false} is VALID [2022-04-28 09:00:21,713 INFO L272 TraceCheckUtils]: 40: Hoare triple {4486#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4486#false} is VALID [2022-04-28 09:00:21,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {4486#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4486#false} is VALID [2022-04-28 09:00:21,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {4486#false} ~i~0 := 0; {4486#false} is VALID [2022-04-28 09:00:21,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {4650#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {4486#false} is VALID [2022-04-28 09:00:21,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4650#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:21,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {4654#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:21,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(< 1 main_~edgecount~0)} ~i~0 := 0; {4654#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:21,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {4581#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {4577#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4581#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:21,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {4567#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4577#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:21,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {4567#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4567#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:21,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {4567#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4567#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4567#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#true} ~i~0 := 0; {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#true} assume !(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#true} assume !!(~i~0 < ~nodecount~0); {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret22 := main(); {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #107#return; {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-28 09:00:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890610458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:21,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:21,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-28 09:00:21,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533823831] [2022-04-28 09:00:21,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533823831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:21,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:21,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:00:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974471109] [2022-04-28 09:00:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:21,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 09:00:21,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:21,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:21,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:21,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:00:21,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:21,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:00:21,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:21,744 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,027 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-28 09:00:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:00:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 09:00:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 09:00:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 09:00:22,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-28 09:00:22,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:22,085 INFO L225 Difference]: With dead ends: 79 [2022-04-28 09:00:22,085 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 09:00:22,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:00:22,086 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:22,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 45 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 09:00:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-28 09:00:22,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:22,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,135 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,135 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,136 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 09:00:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 09:00:22,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:22,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:22,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 54 states. [2022-04-28 09:00:22,136 INFO L87 Difference]: Start difference. First operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 54 states. [2022-04-28 09:00:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,137 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 09:00:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 09:00:22,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:22,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:22,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:22,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-28 09:00:22,138 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 44 [2022-04-28 09:00:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:22,138 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-28 09:00:22,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:22,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-28 09:00:22,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 09:00:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 09:00:22,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:22,209 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:22,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 09:00:22,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:22,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 11 times [2022-04-28 09:00:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343097577] [2022-04-28 09:00:22,421 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:22,421 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash -116869167, now seen corresponding path program 12 times [2022-04-28 09:00:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:22,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814310835] [2022-04-28 09:00:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-28 09:00:22,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-28 09:00:22,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-28 09:00:22,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:22,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {5153#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-28 09:00:22,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-28 09:00:22,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-28 09:00:22,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-28 09:00:22,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {5148#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5148#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:22,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:22,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:22,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:22,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {5149#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:22,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:22,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:22,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {5150#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:22,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:22,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:22,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {5151#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5152#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:22,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {5152#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5144#false} is VALID [2022-04-28 09:00:22,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {5144#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5144#false} is VALID [2022-04-28 09:00:22,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {5144#false} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-28 09:00:22,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-28 09:00:22,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-28 09:00:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814310835] [2022-04-28 09:00:22,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814310835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377106387] [2022-04-28 09:00:22,501 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:22,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:22,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:22,503 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:22,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 09:00:22,585 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:22,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:22,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:22,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-28 09:00:22,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-28 09:00:22,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-28 09:00:22,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-28 09:00:22,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-28 09:00:22,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {5172#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {5172#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5172#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {5172#(<= 5 main_~nodecount~0)} ~i~0 := 0; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {5224#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5261#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {5261#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-28 09:00:22,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-28 09:00:22,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-28 09:00:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 09:00:22,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:22,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-28 09:00:22,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#false} assume 0 == ~cond; {5144#false} is VALID [2022-04-28 09:00:22,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {5144#false} ~cond := #in~cond; {5144#false} is VALID [2022-04-28 09:00:22,949 INFO L272 TraceCheckUtils]: 43: Hoare triple {5144#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5144#false} is VALID [2022-04-28 09:00:22,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-28 09:00:22,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-28 09:00:22,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#false} assume !(~i~0 < ~edgecount~0); {5144#false} is VALID [2022-04-28 09:00:22,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {5144#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5144#false} is VALID [2022-04-28 09:00:22,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {5144#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5144#false} is VALID [2022-04-28 09:00:22,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {5144#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5144#false} is VALID [2022-04-28 09:00:22,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#false} ~i~0 := 0; {5144#false} is VALID [2022-04-28 09:00:22,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {5331#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5144#false} is VALID [2022-04-28 09:00:22,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5331#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {5335#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {5372#(< 1 main_~nodecount~0)} ~i~0 := 0; {5335#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:22,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {5372#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {5372#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {5372#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5372#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:22,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret22 := main(); {5143#true} is VALID [2022-04-28 09:00:22,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #107#return; {5143#true} is VALID [2022-04-28 09:00:22,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-28 09:00:22,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5143#true} is VALID [2022-04-28 09:00:22,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2022-04-28 09:00:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 09:00:22,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377106387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:22,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:22,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-28 09:00:22,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:22,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343097577] [2022-04-28 09:00:22,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343097577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:22,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:22,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:22,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539733571] [2022-04-28 09:00:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:22,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 09:00:22,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:22,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:23,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:00:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:23,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:00:23,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:23,004 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,307 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-28 09:00:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:00:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 09:00:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-28 09:00:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-28 09:00:23,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-28 09:00:23,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,367 INFO L225 Difference]: With dead ends: 85 [2022-04-28 09:00:23,367 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 09:00:23,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:00:23,368 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:23,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 50 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 09:00:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-28 09:00:23,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:23,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:23,428 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:23,428 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,429 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 09:00:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 09:00:23,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:23,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:23,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-28 09:00:23,429 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-28 09:00:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,430 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 09:00:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 09:00:23,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:23,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:23,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:23,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-04-28 09:00:23,431 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 47 [2022-04-28 09:00:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:23,431 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-04-28 09:00:23,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:23,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 64 transitions. [2022-04-28 09:00:23,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-28 09:00:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 09:00:23,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:23,498 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-04-28 09:00:23,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:23,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 09:00:23,699 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 13 times [2022-04-28 09:00:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:23,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826688753] [2022-04-28 09:00:23,702 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:23,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1638069530, now seen corresponding path program 14 times [2022-04-28 09:00:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:23,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722859359] [2022-04-28 09:00:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-28 09:00:23,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 09:00:23,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-28 09:00:23,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:23,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {5856#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-28 09:00:23,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 09:00:23,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-28 09:00:23,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-28 09:00:23,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:23,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:23,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:23,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:23,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {5851#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {5852#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {5853#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {5854#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5855#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:23,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {5855#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-28 09:00:23,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-28 09:00:23,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-28 09:00:23,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-28 09:00:23,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-28 09:00:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:23,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:23,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722859359] [2022-04-28 09:00:23,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722859359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:23,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714680639] [2022-04-28 09:00:23,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:23,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:23,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:23,916 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:23,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 09:00:24,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:24,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:24,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:00:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:24,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:24,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-28 09:00:24,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-28 09:00:24,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 09:00:24,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-28 09:00:24,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-28 09:00:24,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5850#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {5850#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:24,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:24,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:24,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {5929#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:24,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:24,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:24,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {5939#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:24,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:24,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:24,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {5949#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:24,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:24,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:24,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {5959#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5969#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {5969#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-28 09:00:24,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-28 09:00:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:24,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:24,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-28 09:00:24,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-28 09:00:24,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-28 09:00:24,527 INFO L272 TraceCheckUtils]: 46: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {5846#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#false} assume !(~i~0 < ~edgecount~0); {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~i~0 := 0; {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#false} assume !(~i~0 < ~nodecount~0); {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5846#false} is VALID [2022-04-28 09:00:24,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {6051#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5846#false} is VALID [2022-04-28 09:00:24,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6051#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {6055#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6055#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {6065#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6065#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {6075#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6075#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {6085#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6085#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:24,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {6095#(< 4 main_~edgecount~0)} ~i~0 := 0; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {6095#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {6095#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {6095#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6095#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:24,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret22 := main(); {5845#true} is VALID [2022-04-28 09:00:24,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #107#return; {5845#true} is VALID [2022-04-28 09:00:24,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 09:00:24,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5845#true} is VALID [2022-04-28 09:00:24,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-28 09:00:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:24,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714680639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:24,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:24,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-28 09:00:24,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:24,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826688753] [2022-04-28 09:00:24,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826688753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:24,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:24,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:00:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963522162] [2022-04-28 09:00:24,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 09:00:24,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:24,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:24,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:00:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:00:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:00:24,566 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:24,840 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-28 09:00:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:00:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 09:00:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-28 09:00:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-28 09:00:24,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2022-04-28 09:00:24,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:24,903 INFO L225 Difference]: With dead ends: 91 [2022-04-28 09:00:24,903 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 09:00:24,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:00:24,904 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 97 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:24,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 40 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 09:00:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-04-28 09:00:24,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:24,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:24,983 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:24,983 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:24,984 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 09:00:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 09:00:24,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:24,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:24,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-28 09:00:24,984 INFO L87 Difference]: Start difference. First operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-28 09:00:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:24,985 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 09:00:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 09:00:24,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:24,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:24,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:24,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-04-28 09:00:24,986 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 50 [2022-04-28 09:00:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:24,986 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-04-28 09:00:24,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:24,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 68 transitions. [2022-04-28 09:00:25,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-04-28 09:00:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 09:00:25,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:25,059 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-04-28 09:00:25,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:25,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 09:00:25,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 15 times [2022-04-28 09:00:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:25,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [279256845] [2022-04-28 09:00:25,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:25,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 379897649, now seen corresponding path program 16 times [2022-04-28 09:00:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:25,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970390162] [2022-04-28 09:00:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:25,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-28 09:00:25,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-28 09:00:25,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-28 09:00:25,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:25,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {6609#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-28 09:00:25,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-28 09:00:25,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-28 09:00:25,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-28 09:00:25,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {6602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {6602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {6602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:25,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:25,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:25,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {6603#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {6604#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {6605#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {6606#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {6607#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6608#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {6608#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {6598#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {6598#false} assume !(~i~0 < ~nodecount~0); {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {6598#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {6598#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {6598#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {6598#false} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-28 09:00:25,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-28 09:00:25,401 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-28 09:00:25,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-28 09:00:25,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-28 09:00:25,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-28 09:00:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:25,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:25,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970390162] [2022-04-28 09:00:25,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970390162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:25,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31825793] [2022-04-28 09:00:25,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:25,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:25,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:25,403 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:25,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 09:00:25,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:25,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:25,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:00:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:25,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:25,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-28 09:00:25,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6682#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:25,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {6682#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6682#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:25,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {6682#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6682#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:25,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {6682#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6692#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:25,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {6692#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6692#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:25,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {6692#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6692#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:25,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {6692#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6702#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:25,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {6702#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6702#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:25,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {6702#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6702#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:25,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {6702#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6712#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:25,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {6712#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6712#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:25,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {6712#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6712#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:25,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {6712#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6722#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:25,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {6722#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {6726#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {6726#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {6726#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {6726#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {6726#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6726#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {6726#(< 4 main_~edgecount~0)} ~i~0 := 0; {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-28 09:00:25,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-28 09:00:25,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} is VALID [2022-04-28 09:00:25,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {6745#(and (<= main_~i~0 0) (< 4 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6755#(and (<= main_~i~0 1) (< 4 main_~edgecount~0))} is VALID [2022-04-28 09:00:25,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {6755#(and (<= main_~i~0 1) (< 4 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-28 09:00:25,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-28 09:00:25,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-28 09:00:25,747 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-28 09:00:25,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-28 09:00:25,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-28 09:00:25,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-28 09:00:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:25,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:25,966 INFO L290 TraceCheckUtils]: 52: Hoare triple {6598#false} assume !false; {6598#false} is VALID [2022-04-28 09:00:25,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {6598#false} assume 0 == ~cond; {6598#false} is VALID [2022-04-28 09:00:25,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {6598#false} ~cond := #in~cond; {6598#false} is VALID [2022-04-28 09:00:25,967 INFO L272 TraceCheckUtils]: 49: Hoare triple {6598#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6598#false} is VALID [2022-04-28 09:00:25,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {6598#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6598#false} is VALID [2022-04-28 09:00:25,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {6598#false} ~i~0 := 0; {6598#false} is VALID [2022-04-28 09:00:25,967 INFO L290 TraceCheckUtils]: 46: Hoare triple {6795#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {6598#false} is VALID [2022-04-28 09:00:25,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6795#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {6799#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {6809#(< 1 main_~edgecount~0)} ~i~0 := 0; {6799#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:25,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {6809#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {6809#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {6809#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {6809#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {6809#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {6692#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6809#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:25,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {6682#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6692#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:25,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {6682#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6682#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:25,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {6682#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6682#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:25,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6682#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:25,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:25,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {6840#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:25,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6840#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:25,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:25,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {6850#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:25,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {6850#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:25,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:25,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {6860#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:25,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6860#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:25,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {6597#true} ~i~0 := 0; {6597#true} is VALID [2022-04-28 09:00:25,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {6597#true} assume !(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#true} assume !!(~i~0 < ~nodecount~0); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {6597#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {6597#true} call #t~ret22 := main(); {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6597#true} {6597#true} #107#return; {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {6597#true} assume true; {6597#true} is VALID [2022-04-28 09:00:25,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {6597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6597#true} is VALID [2022-04-28 09:00:25,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {6597#true} call ULTIMATE.init(); {6597#true} is VALID [2022-04-28 09:00:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:25,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31825793] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:25,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:25,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-04-28 09:00:25,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:25,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [279256845] [2022-04-28 09:00:25,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [279256845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:25,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:25,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:00:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15059942] [2022-04-28 09:00:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:25,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 09:00:25,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:25,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:26,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:26,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:00:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:00:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:00:26,028 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:26,388 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-04-28 09:00:26,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:00:26,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 09:00:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 09:00:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 09:00:26,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-28 09:00:26,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:26,462 INFO L225 Difference]: With dead ends: 97 [2022-04-28 09:00:26,462 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 09:00:26,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:00:26,463 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 102 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:26,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 50 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 09:00:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-28 09:00:26,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:26,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:26,527 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:26,527 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:26,528 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 09:00:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 09:00:26,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:26,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:26,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-04-28 09:00:26,529 INFO L87 Difference]: Start difference. First operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-04-28 09:00:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:26,529 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 09:00:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 09:00:26,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:26,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:26,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:26,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-04-28 09:00:26,531 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 53 [2022-04-28 09:00:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:26,531 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-04-28 09:00:26,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:26,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 72 transitions. [2022-04-28 09:00:26,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-04-28 09:00:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 09:00:26,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:26,607 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:26,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:26,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 09:00:26,824 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 17 times [2022-04-28 09:00:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:26,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [224627658] [2022-04-28 09:00:26,827 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:26,827 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash 360982970, now seen corresponding path program 18 times [2022-04-28 09:00:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:26,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578771238] [2022-04-28 09:00:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:26,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-28 09:00:26,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-28 09:00:26,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-28 09:00:26,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:26,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-28 09:00:26,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-28 09:00:26,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-28 09:00:26,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-28 09:00:26,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:26,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:26,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:26,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:26,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {7403#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {7404#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {7405#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {7406#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {7407#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {7408#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7409#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:26,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {7409#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7398#false} is VALID [2022-04-28 09:00:26,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {7398#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7398#false} is VALID [2022-04-28 09:00:26,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {7398#false} assume !(~i~0 < ~nodecount~0); {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {7398#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 47: Hoare triple {7398#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {7398#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {7398#false} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-28 09:00:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:26,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578771238] [2022-04-28 09:00:26,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578771238] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:26,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293904724] [2022-04-28 09:00:26,927 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:26,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:26,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:26,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:26,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 09:00:27,026 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:27,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:27,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:27,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:27,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-28 09:00:27,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-28 09:00:27,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-28 09:00:27,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-28 09:00:27,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-28 09:00:27,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {7402#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {7402#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7402#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {7402#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:27,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:27,257 INFO L290 TraceCheckUtils]: 47: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:27,257 INFO L290 TraceCheckUtils]: 48: Hoare triple {7549#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7559#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:27,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {7559#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-28 09:00:27,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-28 09:00:27,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-28 09:00:27,258 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-28 09:00:27,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-28 09:00:27,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-28 09:00:27,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-28 09:00:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-04-28 09:00:27,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:27,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-28 09:00:27,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#false} assume 0 == ~cond; {7398#false} is VALID [2022-04-28 09:00:27,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#false} ~cond := #in~cond; {7398#false} is VALID [2022-04-28 09:00:27,441 INFO L272 TraceCheckUtils]: 52: Hoare triple {7398#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7398#false} is VALID [2022-04-28 09:00:27,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7398#false} is VALID [2022-04-28 09:00:27,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#false} ~i~0 := 0; {7398#false} is VALID [2022-04-28 09:00:27,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {7599#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {7398#false} is VALID [2022-04-28 09:00:27,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7599#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:27,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {7603#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:27,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {7613#(< 1 main_~edgecount~0)} ~i~0 := 0; {7603#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:27,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {7613#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {7613#(< 1 main_~edgecount~0)} ~i~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {7613#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {7613#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {7613#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7613#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:27,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret22 := main(); {7397#true} is VALID [2022-04-28 09:00:27,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #107#return; {7397#true} is VALID [2022-04-28 09:00:27,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-28 09:00:27,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7397#true} is VALID [2022-04-28 09:00:27,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-28 09:00:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-04-28 09:00:27,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293904724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:27,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:27,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2022-04-28 09:00:27,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [224627658] [2022-04-28 09:00:27,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [224627658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:27,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:27,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:00:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906475049] [2022-04-28 09:00:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 09:00:27,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:27,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:27,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:27,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:00:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:00:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:00:27,484 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:27,925 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-28 09:00:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:00:27,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 09:00:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-28 09:00:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-04-28 09:00:27,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2022-04-28 09:00:28,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:28,004 INFO L225 Difference]: With dead ends: 103 [2022-04-28 09:00:28,004 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 09:00:28,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:00:28,005 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 110 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:28,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 60 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 09:00:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-28 09:00:28,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:28,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:28,093 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:28,093 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:28,094 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-28 09:00:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 09:00:28,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:28,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:28,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-28 09:00:28,095 INFO L87 Difference]: Start difference. First operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-28 09:00:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:28,096 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-28 09:00:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 09:00:28,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:28,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:28,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:28,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-04-28 09:00:28,097 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 56 [2022-04-28 09:00:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:28,097 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-04-28 09:00:28,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:28,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 76 transitions. [2022-04-28 09:00:28,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-04-28 09:00:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 09:00:28,180 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:28,180 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:28,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 09:00:28,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 09:00:28,387 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 19 times [2022-04-28 09:00:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:28,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404923060] [2022-04-28 09:00:28,392 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:28,392 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -485503343, now seen corresponding path program 20 times [2022-04-28 09:00:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:28,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518059624] [2022-04-28 09:00:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:28,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-28 09:00:28,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-28 09:00:28,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-28 09:00:28,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:28,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {8247#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-28 09:00:28,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-28 09:00:28,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-28 09:00:28,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-28 09:00:28,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:28,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:28,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:28,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:28,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {8239#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {8240#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {8241#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {8242#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {8243#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {8244#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {8245#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8246#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:28,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {8246#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-28 09:00:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:28,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518059624] [2022-04-28 09:00:28,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518059624] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280105773] [2022-04-28 09:00:28,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:28,519 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:28,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 09:00:28,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:28,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:28,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:00:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:28,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:29,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-28 09:00:29,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-28 09:00:29,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-28 09:00:29,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-28 09:00:29,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-28 09:00:29,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {8238#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {8238#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8238#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {8238#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:29,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:29,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:29,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {8320#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:29,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:29,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:29,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {8330#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:29,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:29,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:29,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {8340#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:29,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:29,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:29,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {8350#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:29,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:29,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:29,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {8360#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:29,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:29,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:29,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {8370#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:29,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:29,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:29,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {8380#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8390#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:29,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {8390#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-28 09:00:29,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-28 09:00:29,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-28 09:00:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:29,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:29,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {8234#false} assume 0 == ~cond; {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#false} ~cond := #in~cond; {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L272 TraceCheckUtils]: 55: Hoare triple {8234#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {8234#false} assume !(~i~0 < ~edgecount~0); {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {8234#false} ~i~0 := 0; {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {8234#false} assume !(~i~0 < ~nodecount~0); {8234#false} is VALID [2022-04-28 09:00:29,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8234#false} is VALID [2022-04-28 09:00:29,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {8472#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8234#false} is VALID [2022-04-28 09:00:29,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8472#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {8476#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8476#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {8486#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8486#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {8496#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8496#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {8506#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8506#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8516#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {8526#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {8526#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8536#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:29,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {8546#(< 7 main_~edgecount~0)} ~i~0 := 0; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {8546#(< 7 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {8546#(< 7 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {8546#(< 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8546#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:29,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#true} call #t~ret22 := main(); {8233#true} is VALID [2022-04-28 09:00:29,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#true} {8233#true} #107#return; {8233#true} is VALID [2022-04-28 09:00:29,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#true} assume true; {8233#true} is VALID [2022-04-28 09:00:29,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8233#true} is VALID [2022-04-28 09:00:29,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {8233#true} call ULTIMATE.init(); {8233#true} is VALID [2022-04-28 09:00:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:29,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280105773] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:29,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:29,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-04-28 09:00:29,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:29,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404923060] [2022-04-28 09:00:29,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404923060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:29,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:29,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:00:29,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462162382] [2022-04-28 09:00:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:29,391 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 09:00:29,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:29,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:29,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:29,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:00:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:00:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=483, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:00:29,424 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:29,843 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-28 09:00:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:00:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 09:00:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-28 09:00:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-28 09:00:29,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2022-04-28 09:00:29,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:29,951 INFO L225 Difference]: With dead ends: 109 [2022-04-28 09:00:29,951 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 09:00:29,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=518, Invalid=888, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 09:00:29,952 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 124 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:29,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 50 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 09:00:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-28 09:00:30,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:30,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:30,039 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:30,040 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:30,040 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-28 09:00:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-28 09:00:30,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:30,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:30,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-04-28 09:00:30,041 INFO L87 Difference]: Start difference. First operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-04-28 09:00:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:30,042 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-28 09:00:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-04-28 09:00:30,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:30,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:30,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:30,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-04-28 09:00:30,043 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 59 [2022-04-28 09:00:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:30,043 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-04-28 09:00:30,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:30,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 80 transitions. [2022-04-28 09:00:30,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-28 09:00:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 09:00:30,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:30,133 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:30,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 09:00:30,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 09:00:30,339 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 21 times [2022-04-28 09:00:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:30,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374865679] [2022-04-28 09:00:30,343 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:30,343 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1888708186, now seen corresponding path program 22 times [2022-04-28 09:00:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148370396] [2022-04-28 09:00:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:30,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-28 09:00:30,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-28 09:00:30,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-28 09:00:30,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:30,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-28 09:00:30,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-28 09:00:30,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-28 09:00:30,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-28 09:00:30,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {9131#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {9131#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9131#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {9131#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:30,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:30,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:30,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {9132#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {9133#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {9134#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {9135#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {9136#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {9137#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {9138#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {9139#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9140#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {9140#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {9127#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {9127#false} assume !(~i~0 < ~nodecount~0); {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {9127#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {9127#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {9127#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {9127#false} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-28 09:00:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:30,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:30,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148370396] [2022-04-28 09:00:30,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148370396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:30,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336415673] [2022-04-28 09:00:30,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:30,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:30,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:30,507 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:30,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 09:00:30,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:30,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:30,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:00:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:30,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:30,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:30,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-28 09:00:30,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9214#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:30,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {9214#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9214#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:30,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {9214#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9214#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:30,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {9214#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9224#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:30,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {9224#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9224#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:30,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {9224#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9224#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:30,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {9224#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9234#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:30,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {9234#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9234#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:30,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {9234#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9234#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:30,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {9234#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9244#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:30,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {9244#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9244#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:30,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {9244#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9244#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:30,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {9244#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9254#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:30,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {9254#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9254#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:30,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {9254#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9254#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:30,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {9254#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9264#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:30,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {9264#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9264#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:30,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {9264#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9264#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:30,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {9264#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9274#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:30,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {9274#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9274#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:30,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {9274#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9274#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:30,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {9274#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9284#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:30,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {9288#(< 7 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {9288#(< 7 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {9288#(< 7 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {9288#(< 7 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {9288#(< 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9288#(< 7 main_~edgecount~0)} is VALID [2022-04-28 09:00:30,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {9288#(< 7 main_~edgecount~0)} ~i~0 := 0; {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:30,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:30,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:30,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {9307#(and (< 7 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9317#(and (< 7 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:00:30,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {9317#(and (< 7 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-28 09:00:30,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-28 09:00:30,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-28 09:00:30,951 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-28 09:00:30,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-28 09:00:30,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-28 09:00:30,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-28 09:00:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:30,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:31,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-28 09:00:31,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-28 09:00:31,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-28 09:00:31,221 INFO L272 TraceCheckUtils]: 58: Hoare triple {9127#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9127#false} is VALID [2022-04-28 09:00:31,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {9127#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9127#false} is VALID [2022-04-28 09:00:31,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {9127#false} ~i~0 := 0; {9127#false} is VALID [2022-04-28 09:00:31,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {9357#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {9127#false} is VALID [2022-04-28 09:00:31,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9357#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:31,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:31,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {9361#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:31,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {9371#(< 1 main_~edgecount~0)} ~i~0 := 0; {9361#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:31,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {9371#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:31,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {9371#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:31,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {9371#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:31,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {9371#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:31,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {9371#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:31,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {9224#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9371#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:31,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {9214#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9224#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:31,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {9214#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9214#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:31,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {9214#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9214#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:31,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9214#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:31,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:31,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {9402#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:31,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9402#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:31,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:31,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {9412#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:31,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9412#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:31,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:31,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {9422#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:31,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9422#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:31,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:31,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {9432#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:31,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9432#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:31,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:31,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {9442#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:31,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {9442#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:31,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:31,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {9452#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9452#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} ~i~0 := 0; {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:31,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:31,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:31,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9126#true} is VALID [2022-04-28 09:00:31,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9126#true} is VALID [2022-04-28 09:00:31,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~i~0 < ~nodecount~0); {9126#true} is VALID [2022-04-28 09:00:31,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9126#true} is VALID [2022-04-28 09:00:31,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret22 := main(); {9126#true} is VALID [2022-04-28 09:00:31,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #107#return; {9126#true} is VALID [2022-04-28 09:00:31,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-28 09:00:31,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9126#true} is VALID [2022-04-28 09:00:31,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-28 09:00:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 71 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:31,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336415673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:31,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:31,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-04-28 09:00:31,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:31,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374865679] [2022-04-28 09:00:31,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374865679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:31,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:31,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:00:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326482223] [2022-04-28 09:00:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 09:00:31,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:31,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:31,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:31,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:00:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:31,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:00:31,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:00:31,284 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:31,736 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-28 09:00:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:00:31,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 09:00:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 09:00:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 09:00:31,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-28 09:00:31,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:31,838 INFO L225 Difference]: With dead ends: 115 [2022-04-28 09:00:31,838 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 09:00:31,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=1436, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 09:00:31,838 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 137 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:31,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 45 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 09:00:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-28 09:00:31,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:31,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:31,920 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:31,920 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:31,921 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 09:00:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-28 09:00:31,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:31,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-04-28 09:00:31,922 INFO L87 Difference]: Start difference. First operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-04-28 09:00:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:31,922 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 09:00:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-04-28 09:00:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:31,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:31,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:31,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-28 09:00:31,924 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 62 [2022-04-28 09:00:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:31,924 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-04-28 09:00:31,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:31,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 84 transitions. [2022-04-28 09:00:32,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-04-28 09:00:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 09:00:32,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:32,021 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:32,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:32,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 09:00:32,227 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:32,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 23 times [2022-04-28 09:00:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:32,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451101935] [2022-04-28 09:00:32,230 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:32,231 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1792029199, now seen corresponding path program 24 times [2022-04-28 09:00:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065686906] [2022-04-28 09:00:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:32,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:32,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-28 09:00:32,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-28 09:00:32,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-28 09:00:32,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:32,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {10083#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-28 09:00:32,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-28 09:00:32,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-28 09:00:32,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-28 09:00:32,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {10072#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:32,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {10072#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {10073#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:32,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:32,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:32,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {10075#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:32,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:32,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:32,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {10076#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:32,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:32,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:32,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {10077#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:32,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:32,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:32,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {10078#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {10079#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {10080#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {10081#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {10082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !(~j~0 < ~edgecount~0); {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {10068#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {10068#false} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-28 09:00:32,385 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-28 09:00:32,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-28 09:00:32,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-28 09:00:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:32,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:32,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065686906] [2022-04-28 09:00:32,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065686906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:32,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644861008] [2022-04-28 09:00:32,386 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:32,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:32,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:32,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:32,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 09:00:32,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:32,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:32,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:32,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:32,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-28 09:00:32,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-28 09:00:32,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-28 09:00:32,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-28 09:00:32,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-28 09:00:32,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {10102#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {10102#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10102#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {10102#(<= 5 main_~nodecount~0)} ~i~0 := 0; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {10154#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10245#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {10245#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-28 09:00:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 09:00:32,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:32,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-04-28 09:00:32,990 INFO L290 TraceCheckUtils]: 63: Hoare triple {10068#false} assume 0 == ~cond; {10068#false} is VALID [2022-04-28 09:00:32,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {10068#false} ~cond := #in~cond; {10068#false} is VALID [2022-04-28 09:00:32,990 INFO L272 TraceCheckUtils]: 61: Hoare triple {10068#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10068#false} is VALID [2022-04-28 09:00:32,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {10068#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-28 09:00:32,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-28 09:00:32,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#false} assume !(~i~0 < ~edgecount~0); {10068#false} is VALID [2022-04-28 09:00:32,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10068#false} is VALID [2022-04-28 09:00:32,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {10068#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10068#false} is VALID [2022-04-28 09:00:32,991 INFO L290 TraceCheckUtils]: 55: Hoare triple {10068#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {10068#false} is VALID [2022-04-28 09:00:32,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {10068#false} ~i~0 := 0; {10068#false} is VALID [2022-04-28 09:00:32,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {10315#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10068#false} is VALID [2022-04-28 09:00:32,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10315#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:00:32,992 INFO L290 TraceCheckUtils]: 51: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:32,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:33,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:33,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:33,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {10319#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:33,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {10410#(< 1 main_~nodecount~0)} ~i~0 := 0; {10319#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:33,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {10410#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {10410#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {10410#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10410#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:33,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {10067#true} call #t~ret22 := main(); {10067#true} is VALID [2022-04-28 09:00:33,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10067#true} {10067#true} #107#return; {10067#true} is VALID [2022-04-28 09:00:33,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume true; {10067#true} is VALID [2022-04-28 09:00:33,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10067#true} is VALID [2022-04-28 09:00:33,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {10067#true} call ULTIMATE.init(); {10067#true} is VALID [2022-04-28 09:00:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 09:00:33,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644861008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:33,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:33,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 20 [2022-04-28 09:00:33,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:33,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451101935] [2022-04-28 09:00:33,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451101935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:33,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:33,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:00:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940202380] [2022-04-28 09:00:33,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:33,032 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 09:00:33,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:33,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:33,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:33,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:00:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:33,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:00:33,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:00:33,069 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:33,550 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2022-04-28 09:00:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:00:33,551 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 09:00:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-28 09:00:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-28 09:00:33,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2022-04-28 09:00:33,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:33,633 INFO L225 Difference]: With dead ends: 121 [2022-04-28 09:00:33,634 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 09:00:33,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:00:33,634 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:33,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 50 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 09:00:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-04-28 09:00:33,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:33,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:33,750 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:33,750 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:33,752 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-28 09:00:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-28 09:00:33,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:33,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:33,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-04-28 09:00:33,752 INFO L87 Difference]: Start difference. First operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-04-28 09:00:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:33,753 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-28 09:00:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-28 09:00:33,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:33,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:33,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:33,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-28 09:00:33,754 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 65 [2022-04-28 09:00:33,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:33,755 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-28 09:00:33,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:33,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-28 09:00:33,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-28 09:00:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 09:00:33,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:33,862 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:33,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:34,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:34,062 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 25 times [2022-04-28 09:00:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:34,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774720654] [2022-04-28 09:00:34,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:34,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash 170568442, now seen corresponding path program 26 times [2022-04-28 09:00:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:34,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22757697] [2022-04-28 09:00:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:34,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-28 09:00:34,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-28 09:00:34,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-28 09:00:34,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:34,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-28 09:00:34,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-28 09:00:34,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-28 09:00:34,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-28 09:00:34,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {11045#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {11046#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {11047#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {11048#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {11049#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {11050#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {11051#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {11052#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {11053#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-28 09:00:34,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-28 09:00:34,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-28 09:00:34,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-28 09:00:34,220 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-28 09:00:34,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-28 09:00:34,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-28 09:00:34,220 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-28 09:00:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:34,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22757697] [2022-04-28 09:00:34,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22757697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:34,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561649304] [2022-04-28 09:00:34,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:34,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:34,221 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:34,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 09:00:34,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:34,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:34,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 09:00:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:34,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:34,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-28 09:00:34,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-28 09:00:34,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-28 09:00:34,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-28 09:00:34,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-28 09:00:34,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {11044#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11044#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:34,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {11044#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:34,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:34,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:34,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {11129#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:34,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:34,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:34,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {11139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {11149#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:34,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:34,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:34,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {11159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:34,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:34,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:34,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {11169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:34,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:34,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:34,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {11179#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {11189#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {11199#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {11209#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:34,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:34,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:34,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {11219#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11229#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:34,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {11229#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-28 09:00:34,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-28 09:00:34,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-28 09:00:34,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-28 09:00:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:34,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 67: Hoare triple {11040#false} assume !false; {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 66: Hoare triple {11040#false} assume 0 == ~cond; {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {11040#false} ~cond := #in~cond; {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L272 TraceCheckUtils]: 64: Hoare triple {11040#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {11040#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {11040#false} assume !(~i~0 < ~edgecount~0); {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {11040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {11040#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {11040#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11040#false} is VALID [2022-04-28 09:00:35,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {11040#false} ~i~0 := 0; {11040#false} is VALID [2022-04-28 09:00:35,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {11040#false} assume !(~i~0 < ~nodecount~0); {11040#false} is VALID [2022-04-28 09:00:35,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {11040#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11040#false} is VALID [2022-04-28 09:00:35,227 INFO L290 TraceCheckUtils]: 54: Hoare triple {11311#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11040#false} is VALID [2022-04-28 09:00:35,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11311#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {11315#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11315#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {11325#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11325#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {11335#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11335#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {11345#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11345#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11355#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {11365#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11365#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11375#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {11385#(< (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11385#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11055#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11054#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:35,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {11413#(<= 11 main_~edgecount~0)} ~i~0 := 0; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {11413#(<= 11 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {11413#(<= 11 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11413#(<= 11 main_~edgecount~0)} is VALID [2022-04-28 09:00:35,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} call #t~ret22 := main(); {11039#true} is VALID [2022-04-28 09:00:35,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} #107#return; {11039#true} is VALID [2022-04-28 09:00:35,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} assume true; {11039#true} is VALID [2022-04-28 09:00:35,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11039#true} is VALID [2022-04-28 09:00:35,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} call ULTIMATE.init(); {11039#true} is VALID [2022-04-28 09:00:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:35,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561649304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:35,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:35,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2022-04-28 09:00:35,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:35,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774720654] [2022-04-28 09:00:35,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774720654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:35,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:35,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 09:00:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436662205] [2022-04-28 09:00:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:35,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 09:00:35,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:35,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:35,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:35,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 09:00:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 09:00:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=746, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 09:00:35,288 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:35,883 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2022-04-28 09:00:35,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 09:00:35,883 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 09:00:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-28 09:00:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-28 09:00:35,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 105 transitions. [2022-04-28 09:00:35,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:35,968 INFO L225 Difference]: With dead ends: 127 [2022-04-28 09:00:35,968 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 09:00:35,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=816, Invalid=1440, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 09:00:35,970 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:35,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 55 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 09:00:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-28 09:00:36,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:36,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:36,077 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:36,077 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:36,078 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-28 09:00:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-28 09:00:36,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:36,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:36,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-04-28 09:00:36,079 INFO L87 Difference]: Start difference. First operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-04-28 09:00:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:36,080 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-28 09:00:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-04-28 09:00:36,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:36,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:36,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:36,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2022-04-28 09:00:36,113 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 68 [2022-04-28 09:00:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:36,113 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2022-04-28 09:00:36,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:36,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 92 transitions. [2022-04-28 09:00:36,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2022-04-28 09:00:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 09:00:36,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:36,235 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:36,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:36,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:36,452 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 27 times [2022-04-28 09:00:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:36,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2065279968] [2022-04-28 09:00:36,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:36,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:36,455 INFO L85 PathProgramCache]: Analyzing trace with hash 527091025, now seen corresponding path program 28 times [2022-04-28 09:00:36,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:36,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503826632] [2022-04-28 09:00:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:36,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-28 09:00:36,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-28 09:00:36,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-28 09:00:36,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:36,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {12089#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-28 09:00:36,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-28 09:00:36,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-28 09:00:36,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-28 09:00:36,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {12076#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {12076#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12076#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:36,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {12076#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:36,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:36,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:36,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {12077#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {12078#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {12079#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {12080#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {12081#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {12082#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {12083#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {12084#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {12085#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {12086#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {12087#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12088#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {12088#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {12072#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 59: Hoare triple {12072#false} assume !(~i~0 < ~nodecount~0); {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 60: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {12072#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {12072#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {12072#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {12072#false} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-28 09:00:36,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-28 09:00:36,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-28 09:00:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:36,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503826632] [2022-04-28 09:00:36,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503826632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:36,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650184663] [2022-04-28 09:00:36,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:36,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:36,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:36,627 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:36,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 09:00:36,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:36,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:36,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:00:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:36,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:37,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {12071#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-28 09:00:37,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12162#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:37,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {12162#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12162#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:37,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {12162#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12162#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:37,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {12162#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12172#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:37,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {12172#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12172#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:37,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {12172#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12172#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:37,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {12172#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12182#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:37,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {12182#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12182#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:37,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {12182#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12182#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:37,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {12182#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12192#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:37,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {12192#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12192#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:37,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {12192#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12192#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:37,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {12192#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12202#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:37,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {12202#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12202#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:37,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {12202#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12202#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:37,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {12202#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12212#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:37,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {12212#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12212#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:37,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {12212#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12212#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:37,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {12212#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12222#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:37,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {12222#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12222#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:37,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {12222#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12222#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:37,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {12222#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12232#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:37,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {12232#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12232#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:37,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {12232#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12232#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:37,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {12232#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12242#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:37,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {12242#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12242#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:37,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {12242#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12242#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:37,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {12242#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12252#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:37,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {12252#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12252#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:37,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {12252#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12252#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:37,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {12252#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12262#(<= 10 main_~j~0)} is VALID [2022-04-28 09:00:37,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {12262#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {12266#(< 10 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {12266#(< 10 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {12266#(< 10 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {12266#(< 10 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {12266#(< 10 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12266#(< 10 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {12266#(< 10 main_~edgecount~0)} ~i~0 := 0; {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:37,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:37,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:37,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {12285#(and (< 10 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12295#(and (< 10 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:00:37,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {12295#(and (< 10 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-28 09:00:37,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-28 09:00:37,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-28 09:00:37,161 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-28 09:00:37,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-28 09:00:37,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-28 09:00:37,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-28 09:00:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 146 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:37,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:37,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {12072#false} assume !false; {12072#false} is VALID [2022-04-28 09:00:37,545 INFO L290 TraceCheckUtils]: 69: Hoare triple {12072#false} assume 0 == ~cond; {12072#false} is VALID [2022-04-28 09:00:37,545 INFO L290 TraceCheckUtils]: 68: Hoare triple {12072#false} ~cond := #in~cond; {12072#false} is VALID [2022-04-28 09:00:37,545 INFO L272 TraceCheckUtils]: 67: Hoare triple {12072#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {12072#false} is VALID [2022-04-28 09:00:37,546 INFO L290 TraceCheckUtils]: 66: Hoare triple {12072#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12072#false} is VALID [2022-04-28 09:00:37,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {12072#false} ~i~0 := 0; {12072#false} is VALID [2022-04-28 09:00:37,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {12335#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {12072#false} is VALID [2022-04-28 09:00:37,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {12335#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:37,547 INFO L290 TraceCheckUtils]: 61: Hoare triple {12339#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:37,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {12349#(< 1 main_~edgecount~0)} ~i~0 := 0; {12339#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:37,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {12349#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {12349#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {12349#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {12349#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {12349#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {12172#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12349#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:37,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {12162#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12172#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:37,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {12162#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12162#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:37,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {12162#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12162#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:37,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12162#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:37,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:37,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {12380#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:37,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12380#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:37,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:37,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {12390#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:37,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12390#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:37,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:37,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {12400#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:37,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12400#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:37,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:37,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {12410#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:37,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12410#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:37,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:37,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {12420#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:37,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12420#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:37,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:37,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {12430#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:37,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12430#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:37,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:37,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {12440#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:37,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12440#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:37,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:37,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {12450#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:37,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {12450#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:37,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:37,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {12460#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:37,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12460#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:37,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {12071#true} ~i~0 := 0; {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {12071#true} assume !(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {12071#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {12071#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {12071#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {12071#true} assume !!(~i~0 < ~nodecount~0); {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {12071#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {12071#true} is VALID [2022-04-28 09:00:37,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {12071#true} call #t~ret22 := main(); {12071#true} is VALID [2022-04-28 09:00:37,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12071#true} {12071#true} #107#return; {12071#true} is VALID [2022-04-28 09:00:37,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {12071#true} assume true; {12071#true} is VALID [2022-04-28 09:00:37,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {12071#true} is VALID [2022-04-28 09:00:37,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {12071#true} call ULTIMATE.init(); {12071#true} is VALID [2022-04-28 09:00:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 146 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:37,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650184663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:37,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:37,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-04-28 09:00:37,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:37,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2065279968] [2022-04-28 09:00:37,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2065279968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:37,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:37,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:00:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537282897] [2022-04-28 09:00:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 09:00:37,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:37,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:37,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:37,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:00:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:37,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:00:37,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1359, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:00:37,614 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:38,248 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-04-28 09:00:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:00:38,248 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 09:00:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-28 09:00:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-04-28 09:00:38,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 109 transitions. [2022-04-28 09:00:38,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:38,352 INFO L225 Difference]: With dead ends: 133 [2022-04-28 09:00:38,352 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 09:00:38,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=607, Invalid=2363, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 09:00:38,354 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 175 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:38,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 45 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 09:00:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-28 09:00:38,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:38,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:38,479 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:38,479 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:38,481 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-28 09:00:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-28 09:00:38,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:38,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:38,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-04-28 09:00:38,482 INFO L87 Difference]: Start difference. First operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-04-28 09:00:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:38,482 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2022-04-28 09:00:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-28 09:00:38,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:38,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:38,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:38,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2022-04-28 09:00:38,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 71 [2022-04-28 09:00:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:38,484 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2022-04-28 09:00:38,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:38,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 96 transitions. [2022-04-28 09:00:38,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2022-04-28 09:00:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 09:00:38,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:38,643 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:38,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:38,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:38,844 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:38,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:38,844 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 29 times [2022-04-28 09:00:38,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:38,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036067698] [2022-04-28 09:00:38,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:38,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash 237238170, now seen corresponding path program 30 times [2022-04-28 09:00:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:38,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567968771] [2022-04-28 09:00:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:39,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-28 09:00:39,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 09:00:39,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-28 09:00:39,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:39,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {13172#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-28 09:00:39,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 09:00:39,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-28 09:00:39,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-28 09:00:39,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {13158#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:39,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {13158#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {13159#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:39,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:39,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:39,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {13160#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {13161#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:39,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:39,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:39,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {13162#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:39,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:39,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:39,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {13163#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:39,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:39,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:39,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {13164#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {13165#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {13166#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {13167#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:39,079 INFO L290 TraceCheckUtils]: 51: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:39,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:39,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {13168#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,080 INFO L290 TraceCheckUtils]: 54: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {13169#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,082 INFO L290 TraceCheckUtils]: 59: Hoare triple {13170#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13171#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {13171#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~j~0 < ~edgecount~0); {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {13154#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {13154#false} assume !(~i~0 < ~nodecount~0); {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {13154#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-28 09:00:39,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-28 09:00:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:39,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:39,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567968771] [2022-04-28 09:00:39,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567968771] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:39,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851728458] [2022-04-28 09:00:39,084 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:39,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:39,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:39,085 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:39,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 09:00:39,210 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:39,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:39,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:39,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:39,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-28 09:00:39,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-28 09:00:39,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 09:00:39,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-28 09:00:39,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-28 09:00:39,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {13191#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {13191#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {13191#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13191#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,494 INFO L290 TraceCheckUtils]: 63: Hoare triple {13191#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:39,494 INFO L290 TraceCheckUtils]: 64: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:39,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:39,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {13366#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13376#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:39,495 INFO L290 TraceCheckUtils]: 67: Hoare triple {13376#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-28 09:00:39,496 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-28 09:00:39,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-28 09:00:39,496 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-28 09:00:39,496 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-28 09:00:39,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-28 09:00:39,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-28 09:00:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-28 09:00:39,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:39,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-28 09:00:39,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-28 09:00:39,735 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-28 09:00:39,735 INFO L272 TraceCheckUtils]: 70: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13154#false} is VALID [2022-04-28 09:00:39,735 INFO L290 TraceCheckUtils]: 69: Hoare triple {13154#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13154#false} is VALID [2022-04-28 09:00:39,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} ~i~0 := 0; {13154#false} is VALID [2022-04-28 09:00:39,736 INFO L290 TraceCheckUtils]: 67: Hoare triple {13416#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {13154#false} is VALID [2022-04-28 09:00:39,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13416#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,736 INFO L290 TraceCheckUtils]: 65: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:39,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {13420#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:39,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {13430#(< 1 main_~edgecount~0)} ~i~0 := 0; {13420#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:39,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,737 INFO L290 TraceCheckUtils]: 60: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {13430#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {13430#(< 1 main_~edgecount~0)} ~i~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {13430#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {13430#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {13430#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13430#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:39,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret22 := main(); {13153#true} is VALID [2022-04-28 09:00:39,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #107#return; {13153#true} is VALID [2022-04-28 09:00:39,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 09:00:39,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13153#true} is VALID [2022-04-28 09:00:39,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-28 09:00:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-28 09:00:39,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851728458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:39,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:39,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2022-04-28 09:00:39,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036067698] [2022-04-28 09:00:39,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036067698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:39,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:39,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 09:00:39,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810152424] [2022-04-28 09:00:39,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 09:00:39,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:39,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:39,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:39,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 09:00:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 09:00:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:00:39,799 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:40,478 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-28 09:00:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 09:00:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 09:00:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-28 09:00:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 113 transitions. [2022-04-28 09:00:40,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 113 transitions. [2022-04-28 09:00:40,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:40,563 INFO L225 Difference]: With dead ends: 139 [2022-04-28 09:00:40,563 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 09:00:40,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=439, Invalid=893, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 09:00:40,564 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:40,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 55 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 09:00:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-28 09:00:40,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:40,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:40,700 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:40,700 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:40,702 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-28 09:00:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-28 09:00:40,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:40,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:40,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-04-28 09:00:40,703 INFO L87 Difference]: Start difference. First operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-04-28 09:00:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:40,715 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-28 09:00:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-04-28 09:00:40,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:40,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:40,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:40,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-04-28 09:00:40,719 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 74 [2022-04-28 09:00:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:40,719 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-04-28 09:00:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:40,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 100 transitions. [2022-04-28 09:00:40,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-04-28 09:00:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 09:00:40,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:40,852 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:40,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:41,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:41,053 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 31 times [2022-04-28 09:00:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:41,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351161850] [2022-04-28 09:00:41,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:41,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1884900175, now seen corresponding path program 32 times [2022-04-28 09:00:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:41,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386797153] [2022-04-28 09:00:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:41,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-28 09:00:41,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-28 09:00:41,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-28 09:00:41,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:41,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {14280#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-28 09:00:41,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-28 09:00:41,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-28 09:00:41,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-28 09:00:41,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:41,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:41,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:41,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:41,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {14266#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {14267#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {14268#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {14269#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {14270#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {14271#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,283 INFO L290 TraceCheckUtils]: 60: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-28 09:00:41,284 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-28 09:00:41,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-28 09:00:41,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-28 09:00:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:41,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:41,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386797153] [2022-04-28 09:00:41,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386797153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:41,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901441632] [2022-04-28 09:00:41,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:41,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:41,286 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:41,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 09:00:41,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:41,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:41,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:00:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:41,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:42,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-28 09:00:42,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-28 09:00:42,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-28 09:00:42,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-28 09:00:42,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-28 09:00:42,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {14265#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {14265#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14265#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {14265#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:42,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:42,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:42,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {14353#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:42,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:42,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:42,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {14363#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {14373#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:42,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:42,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:42,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {14383#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:42,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:42,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:42,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {14393#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:42,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:42,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:42,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {14403#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {14413#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {14423#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {14433#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:42,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:42,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:42,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {14443#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {14453#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {14463#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,064 INFO L290 TraceCheckUtils]: 60: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {14473#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14483#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:42,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {14483#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-28 09:00:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:42,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:42,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {14261#false} assume !false; {14261#false} is VALID [2022-04-28 09:00:42,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {14261#false} assume 0 == ~cond; {14261#false} is VALID [2022-04-28 09:00:42,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {14261#false} ~cond := #in~cond; {14261#false} is VALID [2022-04-28 09:00:42,466 INFO L272 TraceCheckUtils]: 73: Hoare triple {14261#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14261#false} is VALID [2022-04-28 09:00:42,466 INFO L290 TraceCheckUtils]: 72: Hoare triple {14261#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 71: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {14261#false} assume !(~i~0 < ~edgecount~0); {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {14261#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {14261#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {14261#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {14261#false} ~i~0 := 0; {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {14261#false} assume !(~i~0 < ~nodecount~0); {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {14261#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14261#false} is VALID [2022-04-28 09:00:42,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {14565#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14261#false} is VALID [2022-04-28 09:00:42,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14565#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {14569#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14569#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,469 INFO L290 TraceCheckUtils]: 58: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,469 INFO L290 TraceCheckUtils]: 57: Hoare triple {14579#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14579#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {14589#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14589#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {14599#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14599#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14609#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14279#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,474 INFO L290 TraceCheckUtils]: 43: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14278#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14277#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14276#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14275#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14274#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14273#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14272#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:42,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {14691#(<= 14 main_~edgecount~0)} ~i~0 := 0; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {14691#(<= 14 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {14691#(<= 14 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {14260#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14691#(<= 14 main_~edgecount~0)} is VALID [2022-04-28 09:00:42,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {14260#true} call #t~ret22 := main(); {14260#true} is VALID [2022-04-28 09:00:42,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14260#true} {14260#true} #107#return; {14260#true} is VALID [2022-04-28 09:00:42,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {14260#true} assume true; {14260#true} is VALID [2022-04-28 09:00:42,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {14260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14260#true} is VALID [2022-04-28 09:00:42,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {14260#true} call ULTIMATE.init(); {14260#true} is VALID [2022-04-28 09:00:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:42,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901441632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:42,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:42,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 39 [2022-04-28 09:00:42,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:42,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351161850] [2022-04-28 09:00:42,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351161850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:42,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:42,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:00:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520632893] [2022-04-28 09:00:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:42,487 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 09:00:42,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:42,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:42,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:00:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:00:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=893, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 09:00:42,541 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:43,296 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-04-28 09:00:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 09:00:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 09:00:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-28 09:00:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-28 09:00:43,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2022-04-28 09:00:43,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:43,392 INFO L225 Difference]: With dead ends: 145 [2022-04-28 09:00:43,392 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 09:00:43,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=972, Invalid=1890, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 09:00:43,393 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:43,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 55 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 09:00:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-04-28 09:00:43,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:43,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:43,540 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:43,540 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:43,541 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-28 09:00:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-28 09:00:43,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:43,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:43,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-04-28 09:00:43,541 INFO L87 Difference]: Start difference. First operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-04-28 09:00:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:43,542 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-28 09:00:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-28 09:00:43,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:43,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:43,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:43,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-04-28 09:00:43,543 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 77 [2022-04-28 09:00:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:43,543 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-04-28 09:00:43,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:43,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 104 transitions. [2022-04-28 09:00:43,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-04-28 09:00:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 09:00:43,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:43,693 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:43,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:43,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:43,893 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 33 times [2022-04-28 09:00:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:43,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089834318] [2022-04-28 09:00:43,896 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:43,897 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -589738950, now seen corresponding path program 34 times [2022-04-28 09:00:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:43,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008593056] [2022-04-28 09:00:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:44,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-28 09:00:44,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-28 09:00:44,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-28 09:00:44,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:44,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {15448#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-28 09:00:44,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-28 09:00:44,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-28 09:00:44,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-28 09:00:44,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {15432#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:44,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {15432#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {15433#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:44,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:44,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:44,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {15434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {15435#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:44,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:44,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:44,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {15436#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:44,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:44,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:44,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {15437#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:44,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:44,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:44,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {15438#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {15439#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {15440#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {15441#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:44,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:44,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:44,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {15442#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {15443#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {15444#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {15445#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {15446#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15447#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 66: Hoare triple {15447#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~j~0 < ~edgecount~0); {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {15428#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {15428#false} assume !(~i~0 < ~nodecount~0); {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 69: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 70: Hoare triple {15428#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 71: Hoare triple {15428#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {15428#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {15428#false} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-28 09:00:44,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-28 09:00:44,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-28 09:00:44,184 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-28 09:00:44,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-28 09:00:44,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-28 09:00:44,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-28 09:00:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:44,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008593056] [2022-04-28 09:00:44,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008593056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124653805] [2022-04-28 09:00:44,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:44,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:44,187 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:44,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 09:00:44,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:44,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:44,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 09:00:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:44,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:44,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-28 09:00:44,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:44,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:44,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:44,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:44,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-28 09:00:44,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15521#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:44,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {15521#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15521#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:44,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {15521#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15521#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:44,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {15521#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15531#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:44,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {15531#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15531#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:44,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {15531#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15531#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:44,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {15531#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15541#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:44,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {15541#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15541#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:44,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {15541#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15541#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:44,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {15541#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15551#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:44,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {15551#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15551#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:44,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {15551#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15551#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:44,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {15551#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15561#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:44,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {15561#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15561#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:44,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {15561#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15561#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:44,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {15561#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15571#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:44,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {15571#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15571#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:44,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {15571#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15571#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:44,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {15571#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15581#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:44,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {15581#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15581#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:44,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {15581#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15581#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:44,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {15581#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15591#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:44,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {15591#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15591#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:44,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {15591#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15591#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:44,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {15591#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15601#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:44,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {15601#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15601#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:44,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {15601#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15601#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:44,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {15601#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15611#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:44,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {15611#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15611#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:44,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {15611#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15611#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:44,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {15611#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15621#(<= 10 main_~j~0)} is VALID [2022-04-28 09:00:44,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {15621#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15621#(<= 10 main_~j~0)} is VALID [2022-04-28 09:00:44,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {15621#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15621#(<= 10 main_~j~0)} is VALID [2022-04-28 09:00:44,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {15621#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15631#(<= 11 main_~j~0)} is VALID [2022-04-28 09:00:44,823 INFO L290 TraceCheckUtils]: 57: Hoare triple {15631#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15631#(<= 11 main_~j~0)} is VALID [2022-04-28 09:00:44,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {15631#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15631#(<= 11 main_~j~0)} is VALID [2022-04-28 09:00:44,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {15631#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15641#(<= 12 main_~j~0)} is VALID [2022-04-28 09:00:44,824 INFO L290 TraceCheckUtils]: 60: Hoare triple {15641#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15641#(<= 12 main_~j~0)} is VALID [2022-04-28 09:00:44,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {15641#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15641#(<= 12 main_~j~0)} is VALID [2022-04-28 09:00:44,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {15641#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15651#(<= 13 main_~j~0)} is VALID [2022-04-28 09:00:44,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {15651#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-28 09:00:44,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {15655#(< 13 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-28 09:00:44,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {15655#(< 13 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-28 09:00:44,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {15655#(< 13 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-28 09:00:44,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {15655#(< 13 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-28 09:00:44,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {15655#(< 13 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {15655#(< 13 main_~edgecount~0)} is VALID [2022-04-28 09:00:44,828 INFO L290 TraceCheckUtils]: 69: Hoare triple {15655#(< 13 main_~edgecount~0)} ~i~0 := 0; {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-28 09:00:44,828 INFO L290 TraceCheckUtils]: 70: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-28 09:00:44,829 INFO L290 TraceCheckUtils]: 71: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} is VALID [2022-04-28 09:00:44,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {15674#(and (<= main_~i~0 0) (< 13 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15684#(and (<= main_~i~0 1) (< 13 main_~edgecount~0))} is VALID [2022-04-28 09:00:44,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {15684#(and (<= main_~i~0 1) (< 13 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-28 09:00:44,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-28 09:00:44,830 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-28 09:00:44,830 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-28 09:00:44,830 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-28 09:00:44,830 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-28 09:00:44,830 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-28 09:00:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:44,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:45,243 INFO L290 TraceCheckUtils]: 79: Hoare triple {15428#false} assume !false; {15428#false} is VALID [2022-04-28 09:00:45,243 INFO L290 TraceCheckUtils]: 78: Hoare triple {15428#false} assume 0 == ~cond; {15428#false} is VALID [2022-04-28 09:00:45,243 INFO L290 TraceCheckUtils]: 77: Hoare triple {15428#false} ~cond := #in~cond; {15428#false} is VALID [2022-04-28 09:00:45,243 INFO L272 TraceCheckUtils]: 76: Hoare triple {15428#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15428#false} is VALID [2022-04-28 09:00:45,243 INFO L290 TraceCheckUtils]: 75: Hoare triple {15428#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15428#false} is VALID [2022-04-28 09:00:45,243 INFO L290 TraceCheckUtils]: 74: Hoare triple {15428#false} ~i~0 := 0; {15428#false} is VALID [2022-04-28 09:00:45,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {15724#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {15428#false} is VALID [2022-04-28 09:00:45,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15724#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:45,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:45,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {15728#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:45,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {15738#(< 1 main_~edgecount~0)} ~i~0 := 0; {15728#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:45,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {15738#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:45,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {15738#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:45,246 INFO L290 TraceCheckUtils]: 66: Hoare triple {15738#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:45,246 INFO L290 TraceCheckUtils]: 65: Hoare triple {15738#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:45,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {15738#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:45,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {15531#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15738#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:45,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {15521#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15531#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:45,247 INFO L290 TraceCheckUtils]: 61: Hoare triple {15521#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15521#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:45,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {15521#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15521#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:45,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15521#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:45,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:45,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {15769#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:45,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15769#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:45,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:45,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {15779#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:45,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15779#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:45,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:45,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {15789#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:45,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15789#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:45,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:45,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {15799#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:45,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15799#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:45,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:45,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {15809#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:45,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15809#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:45,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:45,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {15819#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:45,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15819#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:45,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:45,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {15829#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:45,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15829#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:45,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:45,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {15839#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:45,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15839#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:45,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:45,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {15849#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:45,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15849#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:45,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:00:45,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {15859#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:00:45,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15859#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:00:45,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:00:45,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {15869#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:00:45,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15869#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:00:45,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {15879#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15879#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {15427#true} ~i~0 := 0; {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {15427#true} assume !(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:45,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {15427#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {15427#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#true} assume !!(~i~0 < ~nodecount~0); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {15427#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {15427#true} call #t~ret22 := main(); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15427#true} {15427#true} #107#return; {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {15427#true} assume true; {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {15427#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {15427#true} call ULTIMATE.init(); {15427#true} is VALID [2022-04-28 09:00:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 248 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:45,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124653805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:45,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:45,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-04-28 09:00:45,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:45,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089834318] [2022-04-28 09:00:45,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089834318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:45,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:45,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 09:00:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116550762] [2022-04-28 09:00:45,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 09:00:45,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:45,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:45,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:45,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 09:00:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:45,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 09:00:45,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1950, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 09:00:45,328 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:46,147 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2022-04-28 09:00:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 09:00:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 09:00:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-28 09:00:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-28 09:00:46,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 121 transitions. [2022-04-28 09:00:46,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:46,320 INFO L225 Difference]: With dead ends: 151 [2022-04-28 09:00:46,320 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 09:00:46,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=3473, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 09:00:46,322 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 209 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:46,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 40 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 09:00:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-04-28 09:00:46,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:46,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:46,502 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:46,502 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:46,503 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-28 09:00:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-28 09:00:46,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:46,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:46,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 90 states. [2022-04-28 09:00:46,504 INFO L87 Difference]: Start difference. First operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 90 states. [2022-04-28 09:00:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:46,504 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-04-28 09:00:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-04-28 09:00:46,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:46,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:46,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:46,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-04-28 09:00:46,506 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 80 [2022-04-28 09:00:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:46,506 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-04-28 09:00:46,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:46,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 108 transitions. [2022-04-28 09:00:46,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-04-28 09:00:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 09:00:46,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:46,668 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:46,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:46,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:46,868 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:46,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 35 times [2022-04-28 09:00:46,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:46,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770347898] [2022-04-28 09:00:46,872 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:46,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1867095057, now seen corresponding path program 36 times [2022-04-28 09:00:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:46,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119616913] [2022-04-28 09:00:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:47,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:47,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-28 09:00:47,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-28 09:00:47,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-28 09:00:47,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:47,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {16672#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-28 09:00:47,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-28 09:00:47,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-28 09:00:47,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-28 09:00:47,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {16655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {16655#(<= 20 main_~edgecount~0)} ~i~0 := 0; {16655#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:47,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {16655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:47,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:47,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:47,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {16656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {16657#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {16658#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {16659#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {16660#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {16661#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {16662#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {16663#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {16664#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {16665#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {16666#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,138 INFO L290 TraceCheckUtils]: 59: Hoare triple {16667#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {16668#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {16669#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,141 INFO L290 TraceCheckUtils]: 66: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,141 INFO L290 TraceCheckUtils]: 68: Hoare triple {16670#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16671#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {16671#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {16651#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {16651#false} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-28 09:00:47,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-28 09:00:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:47,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:47,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119616913] [2022-04-28 09:00:47,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119616913] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:47,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37503581] [2022-04-28 09:00:47,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:47,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:47,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:47,144 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:47,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 09:00:47,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:47,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:47,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:47,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:47,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-28 09:00:47,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-28 09:00:47,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-28 09:00:47,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-28 09:00:47,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-28 09:00:47,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {16691#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {16691#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {16691#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:00:47,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {16691#(<= 5 main_~nodecount~0)} ~i~0 := 0; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,737 INFO L290 TraceCheckUtils]: 57: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,739 INFO L290 TraceCheckUtils]: 61: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,742 INFO L290 TraceCheckUtils]: 68: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {16743#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16888#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {16888#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-28 09:00:47,743 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-28 09:00:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-28 09:00:47,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {16651#false} assume !false; {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {16651#false} assume 0 == ~cond; {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 80: Hoare triple {16651#false} ~cond := #in~cond; {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L272 TraceCheckUtils]: 79: Hoare triple {16651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 78: Hoare triple {16651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {16651#false} assume !(~i~0 < ~edgecount~0); {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {16651#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {16651#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {16651#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16651#false} is VALID [2022-04-28 09:00:48,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {16651#false} ~i~0 := 0; {16651#false} is VALID [2022-04-28 09:00:48,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {16958#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {16651#false} is VALID [2022-04-28 09:00:48,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16958#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,012 INFO L290 TraceCheckUtils]: 69: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,012 INFO L290 TraceCheckUtils]: 68: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,013 INFO L290 TraceCheckUtils]: 67: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,013 INFO L290 TraceCheckUtils]: 66: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,013 INFO L290 TraceCheckUtils]: 65: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,013 INFO L290 TraceCheckUtils]: 64: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,015 INFO L290 TraceCheckUtils]: 59: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {16962#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {17107#(< 1 main_~nodecount~0)} ~i~0 := 0; {16962#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:00:48,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {17107#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {17107#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {17107#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {16650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17107#(< 1 main_~nodecount~0)} is VALID [2022-04-28 09:00:48,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {16650#true} call #t~ret22 := main(); {16650#true} is VALID [2022-04-28 09:00:48,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16650#true} {16650#true} #107#return; {16650#true} is VALID [2022-04-28 09:00:48,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {16650#true} assume true; {16650#true} is VALID [2022-04-28 09:00:48,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {16650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16650#true} is VALID [2022-04-28 09:00:48,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {16650#true} call ULTIMATE.init(); {16650#true} is VALID [2022-04-28 09:00:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-28 09:00:48,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37503581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:48,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:48,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5, 5] total 26 [2022-04-28 09:00:48,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:48,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770347898] [2022-04-28 09:00:48,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770347898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:48,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:48,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 09:00:48,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738555436] [2022-04-28 09:00:48,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 09:00:48,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:48,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:48,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:48,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 09:00:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:48,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 09:00:48,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:00:48,077 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:48,852 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2022-04-28 09:00:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:00:48,852 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 09:00:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-28 09:00:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2022-04-28 09:00:48,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 125 transitions. [2022-04-28 09:00:48,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:48,944 INFO L225 Difference]: With dead ends: 157 [2022-04-28 09:00:48,944 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 09:00:48,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=521, Invalid=1285, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 09:00:48,945 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 208 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:48,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 50 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 09:00:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-28 09:00:49,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:49,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:49,108 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:49,108 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:49,109 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-28 09:00:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-28 09:00:49,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:49,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:49,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-04-28 09:00:49,110 INFO L87 Difference]: Start difference. First operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-04-28 09:00:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:49,110 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-28 09:00:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-28 09:00:49,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:49,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:49,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:49,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-28 09:00:49,112 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 83 [2022-04-28 09:00:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:49,112 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-28 09:00:49,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:49,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-28 09:00:49,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-28 09:00:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 09:00:49,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:49,282 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:49,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 09:00:49,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 09:00:49,482 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:49,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 37 times [2022-04-28 09:00:49,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:49,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736832861] [2022-04-28 09:00:49,497 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:49,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1423660838, now seen corresponding path program 38 times [2022-04-28 09:00:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:49,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500347182] [2022-04-28 09:00:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:49,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-28 09:00:49,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 09:00:49,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-28 09:00:49,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:49,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {17915#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-28 09:00:49,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 09:00:49,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-28 09:00:49,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-28 09:00:49,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:49,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:49,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:49,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:49,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {17898#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {17899#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {17900#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-28 09:00:49,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-28 09:00:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:49,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500347182] [2022-04-28 09:00:49,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500347182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:49,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002326671] [2022-04-28 09:00:49,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:49,756 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:49,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 09:00:49,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:49,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:49,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:00:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:49,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:50,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-28 09:00:50,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-28 09:00:50,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 09:00:50,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-28 09:00:50,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-28 09:00:50,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {17897#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {17897#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17897#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:50,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {17897#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:50,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:50,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:00:50,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {17988#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:50,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:50,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:50,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {17998#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {18008#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:50,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:50,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:50,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {18018#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:50,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:50,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:50,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {18028#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:50,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:50,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:50,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {18038#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {18048#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {18058#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {18068#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:50,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:50,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:50,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {18078#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {18088#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {18098#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {18108#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,645 INFO L290 TraceCheckUtils]: 64: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,645 INFO L290 TraceCheckUtils]: 65: Hoare triple {18118#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,645 INFO L290 TraceCheckUtils]: 66: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,646 INFO L290 TraceCheckUtils]: 67: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,646 INFO L290 TraceCheckUtils]: 68: Hoare triple {18128#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,647 INFO L290 TraceCheckUtils]: 70: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:50,647 INFO L290 TraceCheckUtils]: 71: Hoare triple {18138#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18148#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {18148#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-28 09:00:50,648 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-28 09:00:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:50,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 85: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 83: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L272 TraceCheckUtils]: 82: Hoare triple {17893#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 81: Hoare triple {17893#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 79: Hoare triple {17893#false} assume !(~i~0 < ~edgecount~0); {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {17893#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {17893#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {17893#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 75: Hoare triple {17893#false} ~i~0 := 0; {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {17893#false} assume !(~i~0 < ~nodecount~0); {17893#false} is VALID [2022-04-28 09:00:51,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {17893#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17893#false} is VALID [2022-04-28 09:00:51,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {18230#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17893#false} is VALID [2022-04-28 09:00:51,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18230#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {18234#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18234#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,092 INFO L290 TraceCheckUtils]: 67: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {18244#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {18244#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17914#(<= (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17913#(<= (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17912#(<= (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17911#(<= (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17910#(<= (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17909#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17908#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17907#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17906#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17905#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17904#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17903#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17902#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17901#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:00:51,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {18380#(<= 17 main_~edgecount~0)} ~i~0 := 0; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {18380#(<= 17 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {18380#(<= 17 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18380#(<= 17 main_~edgecount~0)} is VALID [2022-04-28 09:00:51,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret22 := main(); {17892#true} is VALID [2022-04-28 09:00:51,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #107#return; {17892#true} is VALID [2022-04-28 09:00:51,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-28 09:00:51,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {17892#true} is VALID [2022-04-28 09:00:51,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-28 09:00:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:51,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002326671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:51,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:51,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-04-28 09:00:51,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:51,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736832861] [2022-04-28 09:00:51,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736832861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:51,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:51,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 09:00:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490717689] [2022-04-28 09:00:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 09:00:51,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:51,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:51,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:51,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 09:00:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 09:00:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:00:51,163 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:52,012 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-28 09:00:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 09:00:52,012 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 09:00:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-28 09:00:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-04-28 09:00:52,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 129 transitions. [2022-04-28 09:00:52,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:52,117 INFO L225 Difference]: With dead ends: 163 [2022-04-28 09:00:52,117 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 09:00:52,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=2412, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 09:00:52,118 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 233 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:52,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 40 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 09:00:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-28 09:00:52,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:52,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:52,311 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:52,311 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:52,312 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-28 09:00:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-28 09:00:52,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:52,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:52,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-28 09:00:52,313 INFO L87 Difference]: Start difference. First operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-28 09:00:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:52,313 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-28 09:00:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-28 09:00:52,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:52,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:52,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:52,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-28 09:00:52,315 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 86 [2022-04-28 09:00:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:52,315 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-28 09:00:52,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:52,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-28 09:00:52,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 09:00:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 09:00:52,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:52,481 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:52,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 09:00:52,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 09:00:52,682 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:52,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 39 times [2022-04-28 09:00:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:52,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757083606] [2022-04-28 09:00:52,685 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:52,685 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:52,685 INFO L85 PathProgramCache]: Analyzing trace with hash 590969713, now seen corresponding path program 40 times [2022-04-28 09:00:52,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:52,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572160096] [2022-04-28 09:00:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:52,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:52,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-28 09:00:52,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-28 09:00:52,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-28 09:00:52,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:52,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {19218#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-28 09:00:52,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-28 09:00:52,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-28 09:00:52,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-28 09:00:52,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {19199#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:52,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {19199#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {19200#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:52,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:52,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:52,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {19201#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {19202#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:52,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:52,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:52,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {19203#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:52,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:52,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:52,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {19204#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:52,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:52,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:52,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {19205#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {19206#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {19207#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {19208#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:52,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:52,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:52,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {19209#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,998 INFO L290 TraceCheckUtils]: 55: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {19210#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:52,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,000 INFO L290 TraceCheckUtils]: 58: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,000 INFO L290 TraceCheckUtils]: 59: Hoare triple {19211#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,001 INFO L290 TraceCheckUtils]: 61: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,001 INFO L290 TraceCheckUtils]: 62: Hoare triple {19212#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,002 INFO L290 TraceCheckUtils]: 63: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,002 INFO L290 TraceCheckUtils]: 64: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,002 INFO L290 TraceCheckUtils]: 65: Hoare triple {19213#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,003 INFO L290 TraceCheckUtils]: 66: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,003 INFO L290 TraceCheckUtils]: 67: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {19214#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,004 INFO L290 TraceCheckUtils]: 70: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:53,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {19215#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:53,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:53,006 INFO L290 TraceCheckUtils]: 73: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:53,006 INFO L290 TraceCheckUtils]: 74: Hoare triple {19216#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19217#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-28 09:00:53,006 INFO L290 TraceCheckUtils]: 75: Hoare triple {19217#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !(~j~0 < ~edgecount~0); {19195#false} is VALID [2022-04-28 09:00:53,006 INFO L290 TraceCheckUtils]: 76: Hoare triple {19195#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19195#false} is VALID [2022-04-28 09:00:53,006 INFO L290 TraceCheckUtils]: 77: Hoare triple {19195#false} assume !(~i~0 < ~nodecount~0); {19195#false} is VALID [2022-04-28 09:00:53,006 INFO L290 TraceCheckUtils]: 78: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-28 09:00:53,006 INFO L290 TraceCheckUtils]: 79: Hoare triple {19195#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 80: Hoare triple {19195#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 81: Hoare triple {19195#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 82: Hoare triple {19195#false} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-28 09:00:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:53,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572160096] [2022-04-28 09:00:53,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572160096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:53,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817178690] [2022-04-28 09:00:53,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:53,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:53,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:53,009 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:53,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 09:00:53,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:53,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:53,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:00:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:53,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:53,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-28 09:00:53,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-28 09:00:53,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-28 09:00:53,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-28 09:00:53,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-28 09:00:53,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19194#true} is VALID [2022-04-28 09:00:53,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:53,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {19194#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:53,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-28 09:00:53,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19291#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:53,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {19291#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19291#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:53,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {19291#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19291#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:53,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {19291#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19301#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:53,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {19301#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19301#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:53,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {19301#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19301#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:53,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {19301#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19311#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:53,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {19311#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19311#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:53,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {19311#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19311#(<= 2 main_~j~0)} is VALID [2022-04-28 09:00:53,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {19311#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19321#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:53,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {19321#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19321#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:53,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {19321#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19321#(<= 3 main_~j~0)} is VALID [2022-04-28 09:00:53,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {19321#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19331#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:53,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {19331#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19331#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:53,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {19331#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19331#(<= 4 main_~j~0)} is VALID [2022-04-28 09:00:53,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {19331#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19341#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:53,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {19341#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19341#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:53,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {19341#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19341#(<= 5 main_~j~0)} is VALID [2022-04-28 09:00:53,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {19341#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19351#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:53,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {19351#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19351#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:53,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {19351#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19351#(<= 6 main_~j~0)} is VALID [2022-04-28 09:00:53,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {19351#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19361#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:53,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {19361#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19361#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:53,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {19361#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19361#(<= 7 main_~j~0)} is VALID [2022-04-28 09:00:53,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {19361#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19371#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:53,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {19371#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19371#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:53,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {19371#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19371#(<= 8 main_~j~0)} is VALID [2022-04-28 09:00:53,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {19371#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19381#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:53,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {19381#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19381#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:53,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {19381#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19381#(<= 9 main_~j~0)} is VALID [2022-04-28 09:00:53,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {19381#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19391#(<= 10 main_~j~0)} is VALID [2022-04-28 09:00:53,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {19391#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19391#(<= 10 main_~j~0)} is VALID [2022-04-28 09:00:53,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {19391#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19391#(<= 10 main_~j~0)} is VALID [2022-04-28 09:00:53,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {19391#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19401#(<= 11 main_~j~0)} is VALID [2022-04-28 09:00:53,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {19401#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19401#(<= 11 main_~j~0)} is VALID [2022-04-28 09:00:53,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {19401#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19401#(<= 11 main_~j~0)} is VALID [2022-04-28 09:00:53,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {19401#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19411#(<= 12 main_~j~0)} is VALID [2022-04-28 09:00:53,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {19411#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19411#(<= 12 main_~j~0)} is VALID [2022-04-28 09:00:53,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {19411#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19411#(<= 12 main_~j~0)} is VALID [2022-04-28 09:00:53,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {19411#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19421#(<= 13 main_~j~0)} is VALID [2022-04-28 09:00:53,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {19421#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19421#(<= 13 main_~j~0)} is VALID [2022-04-28 09:00:53,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {19421#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19421#(<= 13 main_~j~0)} is VALID [2022-04-28 09:00:53,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {19421#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19431#(<= 14 main_~j~0)} is VALID [2022-04-28 09:00:53,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {19431#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19431#(<= 14 main_~j~0)} is VALID [2022-04-28 09:00:53,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {19431#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19431#(<= 14 main_~j~0)} is VALID [2022-04-28 09:00:53,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {19431#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19441#(<= 15 main_~j~0)} is VALID [2022-04-28 09:00:53,738 INFO L290 TraceCheckUtils]: 69: Hoare triple {19441#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19441#(<= 15 main_~j~0)} is VALID [2022-04-28 09:00:53,739 INFO L290 TraceCheckUtils]: 70: Hoare triple {19441#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19441#(<= 15 main_~j~0)} is VALID [2022-04-28 09:00:53,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {19441#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19451#(<= 16 main_~j~0)} is VALID [2022-04-28 09:00:53,740 INFO L290 TraceCheckUtils]: 72: Hoare triple {19451#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-28 09:00:53,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {19455#(< 16 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-28 09:00:53,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {19455#(< 16 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-28 09:00:53,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {19455#(< 16 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-28 09:00:53,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {19455#(< 16 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-28 09:00:53,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {19455#(< 16 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {19455#(< 16 main_~edgecount~0)} is VALID [2022-04-28 09:00:53,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {19455#(< 16 main_~edgecount~0)} ~i~0 := 0; {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:53,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:53,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-28 09:00:53,742 INFO L290 TraceCheckUtils]: 81: Hoare triple {19474#(and (< 16 main_~edgecount~0) (<= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19484#(and (< 16 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:00:53,743 INFO L290 TraceCheckUtils]: 82: Hoare triple {19484#(and (< 16 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-28 09:00:53,743 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-28 09:00:53,743 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-28 09:00:53,743 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-28 09:00:53,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-28 09:00:53,743 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-28 09:00:53,743 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-28 09:00:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 377 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:53,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:54,232 INFO L290 TraceCheckUtils]: 88: Hoare triple {19195#false} assume !false; {19195#false} is VALID [2022-04-28 09:00:54,233 INFO L290 TraceCheckUtils]: 87: Hoare triple {19195#false} assume 0 == ~cond; {19195#false} is VALID [2022-04-28 09:00:54,233 INFO L290 TraceCheckUtils]: 86: Hoare triple {19195#false} ~cond := #in~cond; {19195#false} is VALID [2022-04-28 09:00:54,233 INFO L272 TraceCheckUtils]: 85: Hoare triple {19195#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {19195#false} is VALID [2022-04-28 09:00:54,233 INFO L290 TraceCheckUtils]: 84: Hoare triple {19195#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19195#false} is VALID [2022-04-28 09:00:54,233 INFO L290 TraceCheckUtils]: 83: Hoare triple {19195#false} ~i~0 := 0; {19195#false} is VALID [2022-04-28 09:00:54,233 INFO L290 TraceCheckUtils]: 82: Hoare triple {19524#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {19195#false} is VALID [2022-04-28 09:00:54,233 INFO L290 TraceCheckUtils]: 81: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {19524#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:54,234 INFO L290 TraceCheckUtils]: 80: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:54,234 INFO L290 TraceCheckUtils]: 79: Hoare triple {19528#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:54,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {19538#(< 1 main_~edgecount~0)} ~i~0 := 0; {19528#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:54,235 INFO L290 TraceCheckUtils]: 77: Hoare triple {19538#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:54,235 INFO L290 TraceCheckUtils]: 76: Hoare triple {19538#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:54,235 INFO L290 TraceCheckUtils]: 75: Hoare triple {19538#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:54,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {19538#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:54,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {19538#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:54,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {19301#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19538#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:54,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {19291#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19301#(<= 1 main_~j~0)} is VALID [2022-04-28 09:00:54,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {19291#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19291#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:54,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {19291#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19291#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:54,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19291#(<= 0 main_~j~0)} is VALID [2022-04-28 09:00:54,237 INFO L290 TraceCheckUtils]: 67: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:54,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {19569#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:54,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19569#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:00:54,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:54,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {19579#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:54,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19579#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:00:54,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:54,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {19589#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:54,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19589#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:00:54,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:54,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {19599#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:54,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19599#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:00:54,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:54,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {19609#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:54,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19609#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:00:54,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:54,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {19619#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:54,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19619#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:00:54,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:54,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {19629#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:54,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19629#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:00:54,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:54,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {19639#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:54,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19639#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:00:54,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:54,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {19649#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:54,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19649#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:00:54,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:00:54,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {19659#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:00:54,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19659#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:00:54,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:00:54,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {19669#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:00:54,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19669#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:00:54,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:00:54,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {19679#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:00:54,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19679#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:00:54,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:00:54,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {19689#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:00:54,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19689#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:00:54,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:00:54,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {19699#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:00:54,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {19699#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:00:54,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:00:54,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {19709#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:00:54,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {19709#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:00:54,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#true} ~i~0 := 0; {19194#true} is VALID [2022-04-28 09:00:54,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {19194#true} assume !(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:54,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {19194#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {19194#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {19194#true} assume !!(~i~0 < ~nodecount~0); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {19194#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {19194#true} call #t~ret22 := main(); {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19194#true} {19194#true} #107#return; {19194#true} is VALID [2022-04-28 09:00:54,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {19194#true} assume true; {19194#true} is VALID [2022-04-28 09:00:54,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {19194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {19194#true} is VALID [2022-04-28 09:00:54,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {19194#true} call ULTIMATE.init(); {19194#true} is VALID [2022-04-28 09:00:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 377 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:00:54,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817178690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:54,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:54,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 60 [2022-04-28 09:00:54,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:54,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1757083606] [2022-04-28 09:00:54,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1757083606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:54,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:54,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 09:00:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415573371] [2022-04-28 09:00:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:54,254 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-28 09:00:54,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:54,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:54,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:54,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 09:00:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 09:00:54,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=2691, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 09:00:54,306 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:55,346 INFO L93 Difference]: Finished difference Result 169 states and 214 transitions. [2022-04-28 09:00:55,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 09:00:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-28 09:00:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-28 09:00:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 133 transitions. [2022-04-28 09:00:55,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 133 transitions. [2022-04-28 09:00:55,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:55,448 INFO L225 Difference]: With dead ends: 169 [2022-04-28 09:00:55,448 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 09:00:55,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1321, Invalid=4841, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 09:00:55,450 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 176 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:55,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 70 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 09:00:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-04-28 09:00:55,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:55,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:55,663 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:55,664 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:55,664 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-28 09:00:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-28 09:00:55,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:55,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:55,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-04-28 09:00:55,665 INFO L87 Difference]: Start difference. First operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-04-28 09:00:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:55,666 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-28 09:00:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-28 09:00:55,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:55,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:55,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:55,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2022-04-28 09:00:55,667 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 89 [2022-04-28 09:00:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:55,667 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2022-04-28 09:00:55,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 21 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:55,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 120 transitions. [2022-04-28 09:00:55,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2022-04-28 09:00:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 09:00:55,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:55,835 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:55,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:56,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 09:00:56,036 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 41 times [2022-04-28 09:00:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:56,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [423293032] [2022-04-28 09:00:56,049 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:56,049 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 576720250, now seen corresponding path program 42 times [2022-04-28 09:00:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:56,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734192617] [2022-04-28 09:00:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:56,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-28 09:00:56,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-28 09:00:56,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-28 09:00:56,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:56,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {20583#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-28 09:00:56,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-28 09:00:56,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-28 09:00:56,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-28 09:00:56,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {20563#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:56,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {20563#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {20564#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {20565#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {20566#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:56,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:56,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:56,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {20567#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:56,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:56,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:56,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {20568#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:56,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:56,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:56,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {20569#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {20570#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {20571#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {20572#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:56,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:56,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:56,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {20573#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {20574#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {20575#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {20576#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {20577#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {20578#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:56,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {20579#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:56,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:56,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:56,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {20580#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-28 09:00:56,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-28 09:00:56,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-28 09:00:56,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {20581#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20582#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-28 09:00:56,382 INFO L290 TraceCheckUtils]: 78: Hoare triple {20582#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume !(~j~0 < ~edgecount~0); {20559#false} is VALID [2022-04-28 09:00:56,382 INFO L290 TraceCheckUtils]: 79: Hoare triple {20559#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20559#false} is VALID [2022-04-28 09:00:56,382 INFO L290 TraceCheckUtils]: 80: Hoare triple {20559#false} assume !(~i~0 < ~nodecount~0); {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {20559#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {20559#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {20559#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {20559#false} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-28 09:00:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734192617] [2022-04-28 09:00:56,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734192617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389509078] [2022-04-28 09:00:56,384 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:56,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:56,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:56,385 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:56,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 09:00:56,528 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:56,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:56,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:00:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:56,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:56,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-28 09:00:56,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-28 09:00:56,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-28 09:00:56,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-28 09:00:56,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-28 09:00:56,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {20602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,830 INFO L290 TraceCheckUtils]: 61: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,831 INFO L290 TraceCheckUtils]: 66: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,831 INFO L290 TraceCheckUtils]: 67: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,831 INFO L290 TraceCheckUtils]: 68: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,832 INFO L290 TraceCheckUtils]: 70: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,832 INFO L290 TraceCheckUtils]: 72: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,833 INFO L290 TraceCheckUtils]: 74: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,833 INFO L290 TraceCheckUtils]: 75: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,833 INFO L290 TraceCheckUtils]: 76: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,833 INFO L290 TraceCheckUtils]: 77: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,834 INFO L290 TraceCheckUtils]: 78: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,834 INFO L290 TraceCheckUtils]: 79: Hoare triple {20602#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,834 INFO L290 TraceCheckUtils]: 80: Hoare triple {20602#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20602#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:00:56,834 INFO L290 TraceCheckUtils]: 81: Hoare triple {20602#(<= 20 main_~edgecount~0)} ~i~0 := 0; {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:56,835 INFO L290 TraceCheckUtils]: 82: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:56,835 INFO L290 TraceCheckUtils]: 83: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:56,836 INFO L290 TraceCheckUtils]: 84: Hoare triple {20831#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20841#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:00:56,836 INFO L290 TraceCheckUtils]: 85: Hoare triple {20841#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-28 09:00:56,836 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-28 09:00:56,836 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-28 09:00:56,836 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-28 09:00:56,836 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-28 09:00:56,836 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-28 09:00:56,836 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-28 09:00:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-28 09:00:56,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:57,103 INFO L290 TraceCheckUtils]: 91: Hoare triple {20559#false} assume !false; {20559#false} is VALID [2022-04-28 09:00:57,103 INFO L290 TraceCheckUtils]: 90: Hoare triple {20559#false} assume 0 == ~cond; {20559#false} is VALID [2022-04-28 09:00:57,103 INFO L290 TraceCheckUtils]: 89: Hoare triple {20559#false} ~cond := #in~cond; {20559#false} is VALID [2022-04-28 09:00:57,103 INFO L272 TraceCheckUtils]: 88: Hoare triple {20559#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {20559#false} is VALID [2022-04-28 09:00:57,103 INFO L290 TraceCheckUtils]: 87: Hoare triple {20559#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20559#false} is VALID [2022-04-28 09:00:57,103 INFO L290 TraceCheckUtils]: 86: Hoare triple {20559#false} ~i~0 := 0; {20559#false} is VALID [2022-04-28 09:00:57,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {20881#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {20559#false} is VALID [2022-04-28 09:00:57,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20881#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:57,105 INFO L290 TraceCheckUtils]: 82: Hoare triple {20885#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:57,105 INFO L290 TraceCheckUtils]: 81: Hoare triple {20895#(< 1 main_~edgecount~0)} ~i~0 := 0; {20885#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:00:57,105 INFO L290 TraceCheckUtils]: 80: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,106 INFO L290 TraceCheckUtils]: 79: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,106 INFO L290 TraceCheckUtils]: 77: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,106 INFO L290 TraceCheckUtils]: 76: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,107 INFO L290 TraceCheckUtils]: 75: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,107 INFO L290 TraceCheckUtils]: 74: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,107 INFO L290 TraceCheckUtils]: 73: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,107 INFO L290 TraceCheckUtils]: 72: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,108 INFO L290 TraceCheckUtils]: 69: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,108 INFO L290 TraceCheckUtils]: 68: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,111 INFO L290 TraceCheckUtils]: 58: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {20895#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {20895#(< 1 main_~edgecount~0)} ~i~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {20895#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {20895#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {20895#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {20558#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {20895#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:00:57,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {20558#true} call #t~ret22 := main(); {20558#true} is VALID [2022-04-28 09:00:57,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20558#true} {20558#true} #107#return; {20558#true} is VALID [2022-04-28 09:00:57,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {20558#true} assume true; {20558#true} is VALID [2022-04-28 09:00:57,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {20558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {20558#true} is VALID [2022-04-28 09:00:57,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {20558#true} call ULTIMATE.init(); {20558#true} is VALID [2022-04-28 09:00:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-28 09:00:57,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389509078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:57,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:57,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 29 [2022-04-28 09:00:57,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:57,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [423293032] [2022-04-28 09:00:57,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [423293032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:57,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:57,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 09:00:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887026519] [2022-04-28 09:00:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 09:00:57,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:57,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:57,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:57,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 09:00:57,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 09:00:57,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:00:57,186 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:58,000 INFO L93 Difference]: Finished difference Result 175 states and 222 transitions. [2022-04-28 09:00:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 09:00:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 09:00:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-28 09:00:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2022-04-28 09:00:58,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 137 transitions. [2022-04-28 09:00:58,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:58,101 INFO L225 Difference]: With dead ends: 175 [2022-04-28 09:00:58,101 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 09:00:58,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1556, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 09:00:58,102 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 200 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:58,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 45 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 09:00:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-04-28 09:00:58,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:58,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:58,323 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:58,323 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:58,324 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-28 09:00:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-28 09:00:58,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:58,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:58,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-04-28 09:00:58,324 INFO L87 Difference]: Start difference. First operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-04-28 09:00:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:58,325 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-04-28 09:00:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2022-04-28 09:00:58,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:58,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:58,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:58,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2022-04-28 09:00:58,327 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 92 [2022-04-28 09:00:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:58,327 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2022-04-28 09:00:58,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 22 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:58,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 124 transitions. [2022-04-28 09:00:58,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-28 09:00:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 09:00:58,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:58,503 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:58,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:58,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:58,715 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 43 times [2022-04-28 09:00:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643778529] [2022-04-28 09:00:58,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:58,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:58,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1272730321, now seen corresponding path program 44 times [2022-04-28 09:00:58,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:58,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297805251] [2022-04-28 09:00:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:58,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:59,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-28 09:00:59,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-28 09:00:59,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-28 09:00:59,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:59,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {21961#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-28 09:00:59,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-28 09:00:59,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-28 09:00:59,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-28 09:00:59,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {21940#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:00:59,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {21940#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {21941#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:59,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:59,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:59,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {21942#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {21943#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:59,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:59,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-28 09:00:59,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {21944#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:59,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:59,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-28 09:00:59,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {21945#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:59,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:59,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-28 09:00:59,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {21946#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {21947#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {21948#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {21949#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:59,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:59,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-28 09:00:59,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {21950#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {21951#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {21952#(and (<= main_~j~0 11) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {21953#(and (<= main_~j~0 12) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,115 INFO L290 TraceCheckUtils]: 64: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,115 INFO L290 TraceCheckUtils]: 65: Hoare triple {21954#(and (<= main_~j~0 13) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {21955#(and (<= main_~j~0 14) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,117 INFO L290 TraceCheckUtils]: 70: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:00:59,118 INFO L290 TraceCheckUtils]: 71: Hoare triple {21956#(and (<= main_~j~0 15) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:59,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:59,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} is VALID [2022-04-28 09:00:59,119 INFO L290 TraceCheckUtils]: 74: Hoare triple {21957#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-28 09:00:59,119 INFO L290 TraceCheckUtils]: 75: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-28 09:00:59,120 INFO L290 TraceCheckUtils]: 76: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} is VALID [2022-04-28 09:00:59,120 INFO L290 TraceCheckUtils]: 77: Hoare triple {21958#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-28 09:00:59,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-28 09:00:59,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} is VALID [2022-04-28 09:00:59,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {21959#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {21960#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 19))} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {21960#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 19))} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-28 09:00:59,123 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-28 09:00:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:00:59,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297805251] [2022-04-28 09:00:59,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297805251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317867025] [2022-04-28 09:00:59,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:59,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:59,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:59,125 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:59,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 09:00:59,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:59,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:59,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 09:00:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:59,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:00,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-28 09:01:00,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-28 09:01:00,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-28 09:01:00,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-28 09:01:00,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-28 09:01:00,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:01:00,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:01:00,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-28 09:01:00,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {22035#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:00,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:00,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:00,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {22045#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {22055#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:01:00,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:01:00,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:01:00,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {22065#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:01:00,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:01:00,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-28 09:01:00,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {22075#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:01:00,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:01:00,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-28 09:01:00,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {22085#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {22095#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {22105#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {22115#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:01:00,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:01:00,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-28 09:01:00,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {22125#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {22135#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {22145#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {22155#(and (<= main_~j~0 12) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {22165#(and (<= main_~j~0 13) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,218 INFO L290 TraceCheckUtils]: 66: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,219 INFO L290 TraceCheckUtils]: 67: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,219 INFO L290 TraceCheckUtils]: 68: Hoare triple {22175#(and (<= main_~j~0 14) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,220 INFO L290 TraceCheckUtils]: 69: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,220 INFO L290 TraceCheckUtils]: 70: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:00,220 INFO L290 TraceCheckUtils]: 71: Hoare triple {22185#(and (<= main_~j~0 15) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-28 09:01:00,221 INFO L290 TraceCheckUtils]: 72: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-28 09:01:00,221 INFO L290 TraceCheckUtils]: 73: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} is VALID [2022-04-28 09:01:00,221 INFO L290 TraceCheckUtils]: 74: Hoare triple {22195#(and (<= 20 main_~edgecount~0) (<= main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-28 09:01:00,222 INFO L290 TraceCheckUtils]: 75: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-28 09:01:00,222 INFO L290 TraceCheckUtils]: 76: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} is VALID [2022-04-28 09:01:00,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {22205#(and (<= 20 main_~edgecount~0) (<= main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-28 09:01:00,223 INFO L290 TraceCheckUtils]: 78: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-28 09:01:00,223 INFO L290 TraceCheckUtils]: 79: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {22215#(and (<= 20 main_~edgecount~0) (<= main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22225#(and (<= 20 main_~edgecount~0) (<= main_~j~0 19))} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 81: Hoare triple {22225#(and (<= 20 main_~edgecount~0) (<= main_~j~0 19))} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-28 09:01:00,224 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-28 09:01:00,225 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-28 09:01:00,225 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-28 09:01:00,225 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-28 09:01:00,225 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-28 09:01:00,225 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-28 09:01:00,225 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-28 09:01:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:01:00,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 94: Hoare triple {21936#false} assume !false; {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 93: Hoare triple {21936#false} assume 0 == ~cond; {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 92: Hoare triple {21936#false} ~cond := #in~cond; {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L272 TraceCheckUtils]: 91: Hoare triple {21936#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 90: Hoare triple {21936#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 89: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 88: Hoare triple {21936#false} assume !(~i~0 < ~edgecount~0); {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {21936#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {21936#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {21936#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 84: Hoare triple {21936#false} ~i~0 := 0; {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 83: Hoare triple {21936#false} assume !(~i~0 < ~nodecount~0); {21936#false} is VALID [2022-04-28 09:01:00,871 INFO L290 TraceCheckUtils]: 82: Hoare triple {21936#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {21936#false} is VALID [2022-04-28 09:01:00,872 INFO L290 TraceCheckUtils]: 81: Hoare triple {22307#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {21936#false} is VALID [2022-04-28 09:01:00,872 INFO L290 TraceCheckUtils]: 80: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22307#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,872 INFO L290 TraceCheckUtils]: 79: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,872 INFO L290 TraceCheckUtils]: 78: Hoare triple {22311#(< (+ main_~j~0 1) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,873 INFO L290 TraceCheckUtils]: 77: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22311#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,873 INFO L290 TraceCheckUtils]: 76: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {22321#(< (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22321#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,874 INFO L290 TraceCheckUtils]: 73: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,882 INFO L290 TraceCheckUtils]: 72: Hoare triple {22331#(< (+ main_~j~0 3) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22331#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,883 INFO L290 TraceCheckUtils]: 69: Hoare triple {22341#(< (+ main_~j~0 4) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,887 INFO L290 TraceCheckUtils]: 68: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22341#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,888 INFO L290 TraceCheckUtils]: 67: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,888 INFO L290 TraceCheckUtils]: 66: Hoare triple {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,889 INFO L290 TraceCheckUtils]: 65: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22351#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {22361#(< (+ main_~j~0 6) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22361#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22371#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {22381#(< (+ main_~j~0 8) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22381#(< (+ main_~j~0 8) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {22391#(< (+ main_~j~0 9) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22391#(< (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {22401#(< (+ main_~j~0 10) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22401#(< (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {22411#(< (+ main_~j~0 11) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22411#(< (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {22421#(< (+ main_~j~0 12) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22421#(< (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {22431#(< (+ main_~j~0 13) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22431#(< (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {22441#(< (+ main_~j~0 14) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22441#(< (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {22451#(< (+ main_~j~0 15) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22451#(< (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {22461#(< (+ main_~j~0 16) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22461#(< (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {22471#(< (+ main_~j~0 17) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22471#(< (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {22481#(< (+ main_~j~0 18) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {22481#(< (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22491#(< (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:00,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {21980#(<= 20 main_~edgecount~0)} ~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {21980#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {21980#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {21935#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21980#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:00,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {21935#true} call #t~ret22 := main(); {21935#true} is VALID [2022-04-28 09:01:00,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21935#true} {21935#true} #107#return; {21935#true} is VALID [2022-04-28 09:01:00,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {21935#true} assume true; {21935#true} is VALID [2022-04-28 09:01:00,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {21935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21935#true} is VALID [2022-04-28 09:01:00,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {21935#true} call ULTIMATE.init(); {21935#true} is VALID [2022-04-28 09:01:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:01:00,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317867025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:00,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:00,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 65 [2022-04-28 09:01:00,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:00,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643778529] [2022-04-28 09:01:00,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643778529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:00,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:00,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 09:01:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192559408] [2022-04-28 09:01:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-28 09:01:00,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:00,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:00,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:00,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 09:01:00,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:00,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 09:01:00,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=2772, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 09:01:00,979 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:02,016 INFO L93 Difference]: Finished difference Result 179 states and 227 transitions. [2022-04-28 09:01:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 09:01:02,016 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-28 09:01:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-28 09:01:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-28 09:01:02,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 138 transitions. [2022-04-28 09:01:02,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:02,117 INFO L225 Difference]: With dead ends: 179 [2022-04-28 09:01:02,118 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 09:01:02,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2333, Invalid=4977, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 09:01:02,120 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 184 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:02,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 60 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:01:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 09:01:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 09:01:02,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:02,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:02,371 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:02,371 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:02,372 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-28 09:01:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-28 09:01:02,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:02,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:02,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-04-28 09:01:02,372 INFO L87 Difference]: Start difference. First operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-04-28 09:01:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:02,373 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-28 09:01:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-28 09:01:02,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:02,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:02,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:02,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-04-28 09:01:02,376 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 95 [2022-04-28 09:01:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:02,376 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-04-28 09:01:02,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 23 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:02,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 128 transitions. [2022-04-28 09:01:02,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-28 09:01:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 09:01:02,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:02,568 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:02,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:02,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 09:01:02,775 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 45 times [2022-04-28 09:01:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:02,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062817358] [2022-04-28 09:01:02,787 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:02,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash 6650394, now seen corresponding path program 46 times [2022-04-28 09:01:02,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:02,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46367987] [2022-04-28 09:01:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:02,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:02,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-28 09:01:02,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-28 09:01:02,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-28 09:01:02,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:02,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {23392#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-28 09:01:02,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-28 09:01:02,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-28 09:01:02,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-28 09:01:02,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {23389#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:02,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {23389#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,906 INFO L290 TraceCheckUtils]: 64: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,907 INFO L290 TraceCheckUtils]: 65: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,907 INFO L290 TraceCheckUtils]: 66: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,907 INFO L290 TraceCheckUtils]: 67: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,908 INFO L290 TraceCheckUtils]: 68: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,908 INFO L290 TraceCheckUtils]: 69: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,908 INFO L290 TraceCheckUtils]: 70: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,909 INFO L290 TraceCheckUtils]: 71: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,909 INFO L290 TraceCheckUtils]: 72: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,909 INFO L290 TraceCheckUtils]: 73: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,910 INFO L290 TraceCheckUtils]: 75: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,910 INFO L290 TraceCheckUtils]: 76: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,911 INFO L290 TraceCheckUtils]: 77: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,911 INFO L290 TraceCheckUtils]: 78: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,912 INFO L290 TraceCheckUtils]: 79: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,912 INFO L290 TraceCheckUtils]: 80: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,912 INFO L290 TraceCheckUtils]: 81: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,913 INFO L290 TraceCheckUtils]: 83: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,913 INFO L290 TraceCheckUtils]: 84: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:02,913 INFO L290 TraceCheckUtils]: 85: Hoare triple {23390#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23391#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 86: Hoare triple {23391#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {23385#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {23385#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 90: Hoare triple {23385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 91: Hoare triple {23385#false} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-28 09:01:02,914 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-28 09:01:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-04-28 09:01:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:02,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46367987] [2022-04-28 09:01:02,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46367987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:02,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031693399] [2022-04-28 09:01:02,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:01:02,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:02,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:02,916 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:02,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 09:01:03,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:01:03,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:03,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 09:01:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:03,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:03,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {23384#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:03,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23465#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:03,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {23465#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23465#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:03,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {23465#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23465#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:03,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {23465#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23475#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:03,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {23475#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23475#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:03,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {23475#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23475#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:03,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {23475#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23485#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:03,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {23485#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23485#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:03,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {23485#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23485#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:03,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {23485#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23495#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:03,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {23495#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23495#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:03,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {23495#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23495#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:03,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {23495#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23505#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:03,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {23505#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23505#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:03,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {23505#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23505#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:03,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {23505#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23515#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:03,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {23515#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23515#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:03,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {23515#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23515#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:03,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {23515#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23525#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:03,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {23525#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23525#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:03,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {23525#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23525#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:03,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {23525#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23535#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:03,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {23535#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23535#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:03,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {23535#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23535#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:03,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {23535#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23545#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:03,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {23545#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23545#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:03,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {23545#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23545#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:03,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {23545#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23555#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:03,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {23555#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23555#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:03,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {23555#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23555#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:03,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {23555#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23565#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:03,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {23565#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23565#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:03,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {23565#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23565#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:03,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {23565#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23575#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:03,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {23575#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23575#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:03,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {23575#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23575#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:03,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {23575#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23585#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:03,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {23585#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23585#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:03,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {23585#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23585#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:03,701 INFO L290 TraceCheckUtils]: 62: Hoare triple {23585#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23595#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:03,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {23595#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23595#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:03,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {23595#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23595#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:03,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {23595#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23605#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:03,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {23605#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23605#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:03,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {23605#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23605#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:03,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {23605#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23615#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:03,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {23615#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23615#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:03,703 INFO L290 TraceCheckUtils]: 70: Hoare triple {23615#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23615#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:03,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {23615#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23625#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:03,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {23625#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23625#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:03,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {23625#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23625#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:03,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {23625#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23635#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:03,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {23635#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23635#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:03,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {23635#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23635#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:03,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {23635#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23645#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:03,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {23645#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23645#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:03,706 INFO L290 TraceCheckUtils]: 79: Hoare triple {23645#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23645#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:03,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {23645#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23655#(<= 19 main_~j~0)} is VALID [2022-04-28 09:01:03,707 INFO L290 TraceCheckUtils]: 81: Hoare triple {23655#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:03,707 INFO L290 TraceCheckUtils]: 82: Hoare triple {23659#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:03,707 INFO L290 TraceCheckUtils]: 83: Hoare triple {23659#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:03,707 INFO L290 TraceCheckUtils]: 84: Hoare triple {23659#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:03,708 INFO L290 TraceCheckUtils]: 85: Hoare triple {23659#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:03,708 INFO L290 TraceCheckUtils]: 86: Hoare triple {23659#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {23659#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:03,708 INFO L290 TraceCheckUtils]: 87: Hoare triple {23659#(< 19 main_~edgecount~0)} ~i~0 := 0; {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:03,709 INFO L290 TraceCheckUtils]: 88: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:03,709 INFO L290 TraceCheckUtils]: 89: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:03,709 INFO L290 TraceCheckUtils]: 90: Hoare triple {23678#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23688#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:01:03,710 INFO L290 TraceCheckUtils]: 91: Hoare triple {23688#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-28 09:01:03,710 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-28 09:01:03,710 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-28 09:01:03,710 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-28 09:01:03,710 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-28 09:01:03,710 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-28 09:01:03,710 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-28 09:01:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 533 proven. 59 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:01:03,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:04,284 INFO L290 TraceCheckUtils]: 97: Hoare triple {23385#false} assume !false; {23385#false} is VALID [2022-04-28 09:01:04,284 INFO L290 TraceCheckUtils]: 96: Hoare triple {23385#false} assume 0 == ~cond; {23385#false} is VALID [2022-04-28 09:01:04,284 INFO L290 TraceCheckUtils]: 95: Hoare triple {23385#false} ~cond := #in~cond; {23385#false} is VALID [2022-04-28 09:01:04,284 INFO L272 TraceCheckUtils]: 94: Hoare triple {23385#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {23385#false} is VALID [2022-04-28 09:01:04,284 INFO L290 TraceCheckUtils]: 93: Hoare triple {23385#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23385#false} is VALID [2022-04-28 09:01:04,284 INFO L290 TraceCheckUtils]: 92: Hoare triple {23385#false} ~i~0 := 0; {23385#false} is VALID [2022-04-28 09:01:04,284 INFO L290 TraceCheckUtils]: 91: Hoare triple {23728#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {23385#false} is VALID [2022-04-28 09:01:04,285 INFO L290 TraceCheckUtils]: 90: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {23728#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:04,285 INFO L290 TraceCheckUtils]: 89: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:04,285 INFO L290 TraceCheckUtils]: 88: Hoare triple {23732#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:04,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {23742#(< 1 main_~edgecount~0)} ~i~0 := 0; {23732#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:04,286 INFO L290 TraceCheckUtils]: 86: Hoare triple {23742#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:04,286 INFO L290 TraceCheckUtils]: 85: Hoare triple {23742#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:04,286 INFO L290 TraceCheckUtils]: 84: Hoare triple {23742#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:04,286 INFO L290 TraceCheckUtils]: 83: Hoare triple {23742#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:04,287 INFO L290 TraceCheckUtils]: 82: Hoare triple {23742#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:04,287 INFO L290 TraceCheckUtils]: 81: Hoare triple {23475#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23742#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:04,287 INFO L290 TraceCheckUtils]: 80: Hoare triple {23465#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23475#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:04,288 INFO L290 TraceCheckUtils]: 79: Hoare triple {23465#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23465#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:04,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {23465#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23465#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:04,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23465#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:04,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:04,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:04,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23773#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:04,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:04,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {23783#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:04,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23783#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:04,291 INFO L290 TraceCheckUtils]: 70: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:04,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {23793#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:04,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23793#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:04,292 INFO L290 TraceCheckUtils]: 67: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:04,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {23803#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:04,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23803#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:04,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:04,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {23813#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:04,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23813#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:04,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:04,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {23823#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:04,294 INFO L290 TraceCheckUtils]: 59: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23823#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:04,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:04,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {23833#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:04,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23833#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:04,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:04,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {23843#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:04,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23843#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:04,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:04,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {23853#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:04,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23853#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:04,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:04,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {23863#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:04,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23863#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:04,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:04,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {23873#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:04,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23873#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:04,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:04,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {23883#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:04,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23883#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:04,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:04,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {23893#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:04,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23893#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:04,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:04,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {23903#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:04,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23903#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:04,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:04,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {23913#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:04,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23913#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:04,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:04,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {23923#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:04,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23923#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:04,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-28 09:01:04,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {23933#(<= 0 (+ main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-28 09:01:04,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {23933#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-28 09:01:04,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-28 09:01:04,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {23943#(<= 0 (+ main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23943#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {23384#true} ~i~0 := 0; {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {23384#true} assume !(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:04,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {23384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {23384#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {23384#true} assume !!(~i~0 < ~nodecount~0); {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {23384#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {23384#true} call #t~ret22 := main(); {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23384#true} {23384#true} #107#return; {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {23384#true} assume true; {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {23384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {23384#true} call ULTIMATE.init(); {23384#true} is VALID [2022-04-28 09:01:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 533 proven. 59 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:01:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031693399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:04,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:04,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 25, 25] total 50 [2022-04-28 09:01:04,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:04,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062817358] [2022-04-28 09:01:04,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062817358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:04,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:04,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:01:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469495] [2022-04-28 09:01:04,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 09:01:04,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:04,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:04,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:04,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:01:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:04,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:01:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=1636, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 09:01:04,327 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:05,203 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2022-04-28 09:01:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:01:05,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 09:01:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-28 09:01:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-28 09:01:05,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-04-28 09:01:05,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:05,283 INFO L225 Difference]: With dead ends: 258 [2022-04-28 09:01:05,283 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 09:01:05,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 09:01:05,285 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 113 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:05,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 34 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 09:01:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 166. [2022-04-28 09:01:05,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:05,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:05,805 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:05,805 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:05,809 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-28 09:01:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-28 09:01:05,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:05,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:05,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 242 states. [2022-04-28 09:01:05,810 INFO L87 Difference]: Start difference. First operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 242 states. [2022-04-28 09:01:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:05,814 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2022-04-28 09:01:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2022-04-28 09:01:05,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:05,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:05,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:05,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2022-04-28 09:01:05,817 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 98 [2022-04-28 09:01:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:05,818 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2022-04-28 09:01:05,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:05,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 212 transitions. [2022-04-28 09:01:06,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-04-28 09:01:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-28 09:01:06,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:06,153 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:06,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:06,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:06,353 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 47 times [2022-04-28 09:01:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951166306] [2022-04-28 09:01:06,356 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:06,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 576417944, now seen corresponding path program 48 times [2022-04-28 09:01:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:06,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230090753] [2022-04-28 09:01:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:06,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-28 09:01:06,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-28 09:01:06,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-28 09:01:06,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:06,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {25371#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-28 09:01:06,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-28 09:01:06,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-28 09:01:06,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-28 09:01:06,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {25367#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:06,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {25367#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,530 INFO L290 TraceCheckUtils]: 63: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,530 INFO L290 TraceCheckUtils]: 64: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,530 INFO L290 TraceCheckUtils]: 65: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,531 INFO L290 TraceCheckUtils]: 66: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,531 INFO L290 TraceCheckUtils]: 67: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,532 INFO L290 TraceCheckUtils]: 68: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,533 INFO L290 TraceCheckUtils]: 71: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,533 INFO L290 TraceCheckUtils]: 72: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,534 INFO L290 TraceCheckUtils]: 74: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,534 INFO L290 TraceCheckUtils]: 75: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,535 INFO L290 TraceCheckUtils]: 76: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,535 INFO L290 TraceCheckUtils]: 77: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,535 INFO L290 TraceCheckUtils]: 78: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,536 INFO L290 TraceCheckUtils]: 79: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,536 INFO L290 TraceCheckUtils]: 80: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,536 INFO L290 TraceCheckUtils]: 81: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,537 INFO L290 TraceCheckUtils]: 83: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,538 INFO L290 TraceCheckUtils]: 84: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:06,538 INFO L290 TraceCheckUtils]: 85: Hoare triple {25368#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,539 INFO L290 TraceCheckUtils]: 87: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,540 INFO L290 TraceCheckUtils]: 90: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,540 INFO L290 TraceCheckUtils]: 91: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,540 INFO L290 TraceCheckUtils]: 92: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,541 INFO L290 TraceCheckUtils]: 93: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,541 INFO L290 TraceCheckUtils]: 94: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,541 INFO L290 TraceCheckUtils]: 95: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,542 INFO L290 TraceCheckUtils]: 96: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,542 INFO L290 TraceCheckUtils]: 97: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,543 INFO L290 TraceCheckUtils]: 98: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,543 INFO L290 TraceCheckUtils]: 99: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,543 INFO L290 TraceCheckUtils]: 100: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,544 INFO L290 TraceCheckUtils]: 101: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,544 INFO L290 TraceCheckUtils]: 102: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,544 INFO L290 TraceCheckUtils]: 103: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,545 INFO L290 TraceCheckUtils]: 104: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,545 INFO L290 TraceCheckUtils]: 105: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,546 INFO L290 TraceCheckUtils]: 106: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,546 INFO L290 TraceCheckUtils]: 107: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,546 INFO L290 TraceCheckUtils]: 108: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,547 INFO L290 TraceCheckUtils]: 109: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,547 INFO L290 TraceCheckUtils]: 110: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,547 INFO L290 TraceCheckUtils]: 111: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,548 INFO L290 TraceCheckUtils]: 112: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,548 INFO L290 TraceCheckUtils]: 113: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,548 INFO L290 TraceCheckUtils]: 114: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,549 INFO L290 TraceCheckUtils]: 115: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,549 INFO L290 TraceCheckUtils]: 116: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,550 INFO L290 TraceCheckUtils]: 117: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,550 INFO L290 TraceCheckUtils]: 118: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,550 INFO L290 TraceCheckUtils]: 119: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,551 INFO L290 TraceCheckUtils]: 120: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,551 INFO L290 TraceCheckUtils]: 121: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,551 INFO L290 TraceCheckUtils]: 122: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,552 INFO L290 TraceCheckUtils]: 123: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,552 INFO L290 TraceCheckUtils]: 124: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,552 INFO L290 TraceCheckUtils]: 125: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,553 INFO L290 TraceCheckUtils]: 126: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,553 INFO L290 TraceCheckUtils]: 127: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,554 INFO L290 TraceCheckUtils]: 128: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,554 INFO L290 TraceCheckUtils]: 129: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,554 INFO L290 TraceCheckUtils]: 130: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,555 INFO L290 TraceCheckUtils]: 131: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,555 INFO L290 TraceCheckUtils]: 132: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,555 INFO L290 TraceCheckUtils]: 133: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,556 INFO L290 TraceCheckUtils]: 134: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,556 INFO L290 TraceCheckUtils]: 135: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,557 INFO L290 TraceCheckUtils]: 136: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,557 INFO L290 TraceCheckUtils]: 137: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,557 INFO L290 TraceCheckUtils]: 138: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,558 INFO L290 TraceCheckUtils]: 139: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,558 INFO L290 TraceCheckUtils]: 140: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,558 INFO L290 TraceCheckUtils]: 141: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,559 INFO L290 TraceCheckUtils]: 142: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,559 INFO L290 TraceCheckUtils]: 143: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,559 INFO L290 TraceCheckUtils]: 144: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,560 INFO L290 TraceCheckUtils]: 145: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,560 INFO L290 TraceCheckUtils]: 146: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,560 INFO L290 TraceCheckUtils]: 147: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:06,561 INFO L290 TraceCheckUtils]: 148: Hoare triple {25369#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25370#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:06,561 INFO L290 TraceCheckUtils]: 149: Hoare triple {25370#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~i~0 < ~nodecount~0); {25363#false} is VALID [2022-04-28 09:01:06,561 INFO L290 TraceCheckUtils]: 150: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-28 09:01:06,561 INFO L290 TraceCheckUtils]: 151: Hoare triple {25363#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-28 09:01:06,561 INFO L290 TraceCheckUtils]: 152: Hoare triple {25363#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25363#false} is VALID [2022-04-28 09:01:06,561 INFO L290 TraceCheckUtils]: 153: Hoare triple {25363#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25363#false} is VALID [2022-04-28 09:01:06,561 INFO L290 TraceCheckUtils]: 154: Hoare triple {25363#false} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-28 09:01:06,562 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-28 09:01:06,562 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-28 09:01:06,562 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-28 09:01:06,562 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-28 09:01:06,562 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-28 09:01:06,562 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-28 09:01:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1245 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2022-04-28 09:01:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:06,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230090753] [2022-04-28 09:01:06,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230090753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:06,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399784004] [2022-04-28 09:01:06,563 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:01:06,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:06,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:06,564 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:06,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 09:01:06,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:01:06,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:06,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:01:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:06,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:07,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-28 09:01:07,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-28 09:01:07,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-28 09:01:07,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-28 09:01:07,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-28 09:01:07,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {25390#(<= 20 main_~edgecount~0)} ~i~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,327 INFO L290 TraceCheckUtils]: 55: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,328 INFO L290 TraceCheckUtils]: 62: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,332 INFO L290 TraceCheckUtils]: 79: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,333 INFO L290 TraceCheckUtils]: 80: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,333 INFO L290 TraceCheckUtils]: 81: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,333 INFO L290 TraceCheckUtils]: 82: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,333 INFO L290 TraceCheckUtils]: 83: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,333 INFO L290 TraceCheckUtils]: 84: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,334 INFO L290 TraceCheckUtils]: 85: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,334 INFO L290 TraceCheckUtils]: 86: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,334 INFO L290 TraceCheckUtils]: 87: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,334 INFO L290 TraceCheckUtils]: 88: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,335 INFO L290 TraceCheckUtils]: 90: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,335 INFO L290 TraceCheckUtils]: 91: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,335 INFO L290 TraceCheckUtils]: 92: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,336 INFO L290 TraceCheckUtils]: 93: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,336 INFO L290 TraceCheckUtils]: 94: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,336 INFO L290 TraceCheckUtils]: 95: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,336 INFO L290 TraceCheckUtils]: 96: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,336 INFO L290 TraceCheckUtils]: 97: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,337 INFO L290 TraceCheckUtils]: 99: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,337 INFO L290 TraceCheckUtils]: 100: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,337 INFO L290 TraceCheckUtils]: 101: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,338 INFO L290 TraceCheckUtils]: 102: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,338 INFO L290 TraceCheckUtils]: 103: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,338 INFO L290 TraceCheckUtils]: 104: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,338 INFO L290 TraceCheckUtils]: 105: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,339 INFO L290 TraceCheckUtils]: 106: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,339 INFO L290 TraceCheckUtils]: 107: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,339 INFO L290 TraceCheckUtils]: 108: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,339 INFO L290 TraceCheckUtils]: 109: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,340 INFO L290 TraceCheckUtils]: 110: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,340 INFO L290 TraceCheckUtils]: 111: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,340 INFO L290 TraceCheckUtils]: 112: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,340 INFO L290 TraceCheckUtils]: 113: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,340 INFO L290 TraceCheckUtils]: 114: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,341 INFO L290 TraceCheckUtils]: 115: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,341 INFO L290 TraceCheckUtils]: 116: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,344 INFO L290 TraceCheckUtils]: 117: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,344 INFO L290 TraceCheckUtils]: 118: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,345 INFO L290 TraceCheckUtils]: 119: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,345 INFO L290 TraceCheckUtils]: 120: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,345 INFO L290 TraceCheckUtils]: 121: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,345 INFO L290 TraceCheckUtils]: 122: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,346 INFO L290 TraceCheckUtils]: 123: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,346 INFO L290 TraceCheckUtils]: 124: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,346 INFO L290 TraceCheckUtils]: 125: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,347 INFO L290 TraceCheckUtils]: 126: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,347 INFO L290 TraceCheckUtils]: 127: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,347 INFO L290 TraceCheckUtils]: 128: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,348 INFO L290 TraceCheckUtils]: 129: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,348 INFO L290 TraceCheckUtils]: 130: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,355 INFO L290 TraceCheckUtils]: 131: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,355 INFO L290 TraceCheckUtils]: 132: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,355 INFO L290 TraceCheckUtils]: 133: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,356 INFO L290 TraceCheckUtils]: 134: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,356 INFO L290 TraceCheckUtils]: 135: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,356 INFO L290 TraceCheckUtils]: 136: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,356 INFO L290 TraceCheckUtils]: 137: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,357 INFO L290 TraceCheckUtils]: 138: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,357 INFO L290 TraceCheckUtils]: 139: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,357 INFO L290 TraceCheckUtils]: 140: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,357 INFO L290 TraceCheckUtils]: 141: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,358 INFO L290 TraceCheckUtils]: 142: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,358 INFO L290 TraceCheckUtils]: 143: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,358 INFO L290 TraceCheckUtils]: 144: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,358 INFO L290 TraceCheckUtils]: 145: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,359 INFO L290 TraceCheckUtils]: 146: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,359 INFO L290 TraceCheckUtils]: 147: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,359 INFO L290 TraceCheckUtils]: 148: Hoare triple {25390#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,359 INFO L290 TraceCheckUtils]: 149: Hoare triple {25390#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25390#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,360 INFO L290 TraceCheckUtils]: 150: Hoare triple {25390#(<= 20 main_~edgecount~0)} ~i~0 := 0; {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:07,360 INFO L290 TraceCheckUtils]: 151: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:07,360 INFO L290 TraceCheckUtils]: 152: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:07,361 INFO L290 TraceCheckUtils]: 153: Hoare triple {25826#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25836#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:07,361 INFO L290 TraceCheckUtils]: 154: Hoare triple {25836#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-28 09:01:07,361 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-28 09:01:07,361 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-28 09:01:07,361 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-28 09:01:07,361 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-28 09:01:07,362 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-28 09:01:07,362 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-28 09:01:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2022-04-28 09:01:07,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:07,861 INFO L290 TraceCheckUtils]: 160: Hoare triple {25363#false} assume !false; {25363#false} is VALID [2022-04-28 09:01:07,861 INFO L290 TraceCheckUtils]: 159: Hoare triple {25363#false} assume 0 == ~cond; {25363#false} is VALID [2022-04-28 09:01:07,862 INFO L290 TraceCheckUtils]: 158: Hoare triple {25363#false} ~cond := #in~cond; {25363#false} is VALID [2022-04-28 09:01:07,862 INFO L272 TraceCheckUtils]: 157: Hoare triple {25363#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {25363#false} is VALID [2022-04-28 09:01:07,862 INFO L290 TraceCheckUtils]: 156: Hoare triple {25363#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25363#false} is VALID [2022-04-28 09:01:07,862 INFO L290 TraceCheckUtils]: 155: Hoare triple {25363#false} ~i~0 := 0; {25363#false} is VALID [2022-04-28 09:01:07,862 INFO L290 TraceCheckUtils]: 154: Hoare triple {25876#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {25363#false} is VALID [2022-04-28 09:01:07,862 INFO L290 TraceCheckUtils]: 153: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {25876#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,863 INFO L290 TraceCheckUtils]: 152: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:07,863 INFO L290 TraceCheckUtils]: 151: Hoare triple {25880#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:07,863 INFO L290 TraceCheckUtils]: 150: Hoare triple {25890#(< 1 main_~edgecount~0)} ~i~0 := 0; {25880#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:07,863 INFO L290 TraceCheckUtils]: 149: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,864 INFO L290 TraceCheckUtils]: 148: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,864 INFO L290 TraceCheckUtils]: 147: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,864 INFO L290 TraceCheckUtils]: 146: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,864 INFO L290 TraceCheckUtils]: 145: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,864 INFO L290 TraceCheckUtils]: 144: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,865 INFO L290 TraceCheckUtils]: 143: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,865 INFO L290 TraceCheckUtils]: 142: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,865 INFO L290 TraceCheckUtils]: 141: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,865 INFO L290 TraceCheckUtils]: 140: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,866 INFO L290 TraceCheckUtils]: 139: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,866 INFO L290 TraceCheckUtils]: 138: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,866 INFO L290 TraceCheckUtils]: 137: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,866 INFO L290 TraceCheckUtils]: 136: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,866 INFO L290 TraceCheckUtils]: 135: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,867 INFO L290 TraceCheckUtils]: 134: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,867 INFO L290 TraceCheckUtils]: 133: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,867 INFO L290 TraceCheckUtils]: 132: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,867 INFO L290 TraceCheckUtils]: 131: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,867 INFO L290 TraceCheckUtils]: 130: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,868 INFO L290 TraceCheckUtils]: 129: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,868 INFO L290 TraceCheckUtils]: 128: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,868 INFO L290 TraceCheckUtils]: 127: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,868 INFO L290 TraceCheckUtils]: 126: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,869 INFO L290 TraceCheckUtils]: 125: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,869 INFO L290 TraceCheckUtils]: 124: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,869 INFO L290 TraceCheckUtils]: 123: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,869 INFO L290 TraceCheckUtils]: 122: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,869 INFO L290 TraceCheckUtils]: 121: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,870 INFO L290 TraceCheckUtils]: 120: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,870 INFO L290 TraceCheckUtils]: 119: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,870 INFO L290 TraceCheckUtils]: 118: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,870 INFO L290 TraceCheckUtils]: 117: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,870 INFO L290 TraceCheckUtils]: 116: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,871 INFO L290 TraceCheckUtils]: 115: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,871 INFO L290 TraceCheckUtils]: 114: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,871 INFO L290 TraceCheckUtils]: 113: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,871 INFO L290 TraceCheckUtils]: 112: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,872 INFO L290 TraceCheckUtils]: 111: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,872 INFO L290 TraceCheckUtils]: 110: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,872 INFO L290 TraceCheckUtils]: 109: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,872 INFO L290 TraceCheckUtils]: 108: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,872 INFO L290 TraceCheckUtils]: 107: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,873 INFO L290 TraceCheckUtils]: 106: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,873 INFO L290 TraceCheckUtils]: 105: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,873 INFO L290 TraceCheckUtils]: 104: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,873 INFO L290 TraceCheckUtils]: 103: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,873 INFO L290 TraceCheckUtils]: 102: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,874 INFO L290 TraceCheckUtils]: 101: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,874 INFO L290 TraceCheckUtils]: 100: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,874 INFO L290 TraceCheckUtils]: 99: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,874 INFO L290 TraceCheckUtils]: 98: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,875 INFO L290 TraceCheckUtils]: 97: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,875 INFO L290 TraceCheckUtils]: 96: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,875 INFO L290 TraceCheckUtils]: 95: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,875 INFO L290 TraceCheckUtils]: 94: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,875 INFO L290 TraceCheckUtils]: 93: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,876 INFO L290 TraceCheckUtils]: 92: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,876 INFO L290 TraceCheckUtils]: 91: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,876 INFO L290 TraceCheckUtils]: 90: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,876 INFO L290 TraceCheckUtils]: 89: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,876 INFO L290 TraceCheckUtils]: 88: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,877 INFO L290 TraceCheckUtils]: 87: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,877 INFO L290 TraceCheckUtils]: 86: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,877 INFO L290 TraceCheckUtils]: 85: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,877 INFO L290 TraceCheckUtils]: 84: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,878 INFO L290 TraceCheckUtils]: 80: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,879 INFO L290 TraceCheckUtils]: 76: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {25890#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {25890#(< 1 main_~edgecount~0)} ~i~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {25890#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {25890#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {25890#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {25890#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:07,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#true} call #t~ret22 := main(); {25362#true} is VALID [2022-04-28 09:01:07,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#true} {25362#true} #107#return; {25362#true} is VALID [2022-04-28 09:01:07,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#true} assume true; {25362#true} is VALID [2022-04-28 09:01:07,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {25362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {25362#true} is VALID [2022-04-28 09:01:07,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {25362#true} call ULTIMATE.init(); {25362#true} is VALID [2022-04-28 09:01:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2022-04-28 09:01:07,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399784004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:07,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:07,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-28 09:01:07,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:07,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951166306] [2022-04-28 09:01:07,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951166306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:07,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:07,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:01:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287656623] [2022-04-28 09:01:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-28 09:01:07,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:07,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:07,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:07,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:01:07,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:01:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:01:07,918 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:09,200 INFO L93 Difference]: Finished difference Result 329 states and 424 transitions. [2022-04-28 09:01:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:01:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-28 09:01:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 09:01:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 09:01:09,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-28 09:01:09,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:09,295 INFO L225 Difference]: With dead ends: 329 [2022-04-28 09:01:09,295 INFO L226 Difference]: Without dead ends: 313 [2022-04-28 09:01:09,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:01:09,296 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:09,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 34 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-28 09:01:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 229. [2022-04-28 09:01:10,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:10,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:10,083 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:10,083 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:10,087 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-28 09:01:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-28 09:01:10,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:10,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:10,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 313 states. [2022-04-28 09:01:10,088 INFO L87 Difference]: Start difference. First operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 313 states. [2022-04-28 09:01:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:10,092 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2022-04-28 09:01:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2022-04-28 09:01:10,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:10,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:10,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:10,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-04-28 09:01:10,096 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 161 [2022-04-28 09:01:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:10,096 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-04-28 09:01:10,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:10,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 296 transitions. [2022-04-28 09:01:10,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-28 09:01:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-28 09:01:10,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:10,556 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 60, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:10,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:10,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 09:01:10,775 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 49 times [2022-04-28 09:01:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:10,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765835088] [2022-04-28 09:01:10,778 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:10,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 54436442, now seen corresponding path program 50 times [2022-04-28 09:01:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:10,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246427202] [2022-04-28 09:01:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:10,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-28 09:01:10,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-28 09:01:10,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-28 09:01:10,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:10,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {28103#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-28 09:01:10,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-28 09:01:10,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-28 09:01:10,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-28 09:01:10,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:10,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:10,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:10,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {28098#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:11,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {28098#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,023 INFO L290 TraceCheckUtils]: 67: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,024 INFO L290 TraceCheckUtils]: 71: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,024 INFO L290 TraceCheckUtils]: 72: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,025 INFO L290 TraceCheckUtils]: 73: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,027 INFO L290 TraceCheckUtils]: 79: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,027 INFO L290 TraceCheckUtils]: 80: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,027 INFO L290 TraceCheckUtils]: 81: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,028 INFO L290 TraceCheckUtils]: 82: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,028 INFO L290 TraceCheckUtils]: 83: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,028 INFO L290 TraceCheckUtils]: 84: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:11,029 INFO L290 TraceCheckUtils]: 85: Hoare triple {28099#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,029 INFO L290 TraceCheckUtils]: 86: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,029 INFO L290 TraceCheckUtils]: 87: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,030 INFO L290 TraceCheckUtils]: 88: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,030 INFO L290 TraceCheckUtils]: 89: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,030 INFO L290 TraceCheckUtils]: 90: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,031 INFO L290 TraceCheckUtils]: 91: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,031 INFO L290 TraceCheckUtils]: 92: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,032 INFO L290 TraceCheckUtils]: 93: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,032 INFO L290 TraceCheckUtils]: 94: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,032 INFO L290 TraceCheckUtils]: 95: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,033 INFO L290 TraceCheckUtils]: 96: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,033 INFO L290 TraceCheckUtils]: 97: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,034 INFO L290 TraceCheckUtils]: 98: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,034 INFO L290 TraceCheckUtils]: 99: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,034 INFO L290 TraceCheckUtils]: 100: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,035 INFO L290 TraceCheckUtils]: 101: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,035 INFO L290 TraceCheckUtils]: 102: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,035 INFO L290 TraceCheckUtils]: 103: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,036 INFO L290 TraceCheckUtils]: 104: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,036 INFO L290 TraceCheckUtils]: 105: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,036 INFO L290 TraceCheckUtils]: 106: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,037 INFO L290 TraceCheckUtils]: 107: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,037 INFO L290 TraceCheckUtils]: 108: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,037 INFO L290 TraceCheckUtils]: 109: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,038 INFO L290 TraceCheckUtils]: 110: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,038 INFO L290 TraceCheckUtils]: 111: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,038 INFO L290 TraceCheckUtils]: 112: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,039 INFO L290 TraceCheckUtils]: 113: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,039 INFO L290 TraceCheckUtils]: 114: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,039 INFO L290 TraceCheckUtils]: 115: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,040 INFO L290 TraceCheckUtils]: 116: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,040 INFO L290 TraceCheckUtils]: 117: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,040 INFO L290 TraceCheckUtils]: 118: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,041 INFO L290 TraceCheckUtils]: 119: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,041 INFO L290 TraceCheckUtils]: 120: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,041 INFO L290 TraceCheckUtils]: 121: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,042 INFO L290 TraceCheckUtils]: 122: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,042 INFO L290 TraceCheckUtils]: 123: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,043 INFO L290 TraceCheckUtils]: 124: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,043 INFO L290 TraceCheckUtils]: 125: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,043 INFO L290 TraceCheckUtils]: 126: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,044 INFO L290 TraceCheckUtils]: 127: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,044 INFO L290 TraceCheckUtils]: 128: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,044 INFO L290 TraceCheckUtils]: 129: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,045 INFO L290 TraceCheckUtils]: 130: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,045 INFO L290 TraceCheckUtils]: 131: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,045 INFO L290 TraceCheckUtils]: 132: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,046 INFO L290 TraceCheckUtils]: 133: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,046 INFO L290 TraceCheckUtils]: 134: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,046 INFO L290 TraceCheckUtils]: 135: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,047 INFO L290 TraceCheckUtils]: 136: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,047 INFO L290 TraceCheckUtils]: 137: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,047 INFO L290 TraceCheckUtils]: 138: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,048 INFO L290 TraceCheckUtils]: 139: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,048 INFO L290 TraceCheckUtils]: 140: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,048 INFO L290 TraceCheckUtils]: 141: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,049 INFO L290 TraceCheckUtils]: 142: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,049 INFO L290 TraceCheckUtils]: 143: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,049 INFO L290 TraceCheckUtils]: 144: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,050 INFO L290 TraceCheckUtils]: 145: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,050 INFO L290 TraceCheckUtils]: 146: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,050 INFO L290 TraceCheckUtils]: 147: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:11,051 INFO L290 TraceCheckUtils]: 148: Hoare triple {28100#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,051 INFO L290 TraceCheckUtils]: 149: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,051 INFO L290 TraceCheckUtils]: 150: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,052 INFO L290 TraceCheckUtils]: 151: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,052 INFO L290 TraceCheckUtils]: 152: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,053 INFO L290 TraceCheckUtils]: 153: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,053 INFO L290 TraceCheckUtils]: 154: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,053 INFO L290 TraceCheckUtils]: 155: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,054 INFO L290 TraceCheckUtils]: 156: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,054 INFO L290 TraceCheckUtils]: 157: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,054 INFO L290 TraceCheckUtils]: 158: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,055 INFO L290 TraceCheckUtils]: 159: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,055 INFO L290 TraceCheckUtils]: 160: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,055 INFO L290 TraceCheckUtils]: 161: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,056 INFO L290 TraceCheckUtils]: 162: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,056 INFO L290 TraceCheckUtils]: 163: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,056 INFO L290 TraceCheckUtils]: 164: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,057 INFO L290 TraceCheckUtils]: 165: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,057 INFO L290 TraceCheckUtils]: 166: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,058 INFO L290 TraceCheckUtils]: 167: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,058 INFO L290 TraceCheckUtils]: 168: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,058 INFO L290 TraceCheckUtils]: 169: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,059 INFO L290 TraceCheckUtils]: 170: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,059 INFO L290 TraceCheckUtils]: 171: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,059 INFO L290 TraceCheckUtils]: 172: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,060 INFO L290 TraceCheckUtils]: 173: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,060 INFO L290 TraceCheckUtils]: 174: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,061 INFO L290 TraceCheckUtils]: 175: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,061 INFO L290 TraceCheckUtils]: 176: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,061 INFO L290 TraceCheckUtils]: 177: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,062 INFO L290 TraceCheckUtils]: 178: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,062 INFO L290 TraceCheckUtils]: 179: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,062 INFO L290 TraceCheckUtils]: 180: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,063 INFO L290 TraceCheckUtils]: 181: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,063 INFO L290 TraceCheckUtils]: 182: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,063 INFO L290 TraceCheckUtils]: 183: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,064 INFO L290 TraceCheckUtils]: 184: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,064 INFO L290 TraceCheckUtils]: 185: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,064 INFO L290 TraceCheckUtils]: 186: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,065 INFO L290 TraceCheckUtils]: 187: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,065 INFO L290 TraceCheckUtils]: 188: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,065 INFO L290 TraceCheckUtils]: 189: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,066 INFO L290 TraceCheckUtils]: 190: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,066 INFO L290 TraceCheckUtils]: 191: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,067 INFO L290 TraceCheckUtils]: 192: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,067 INFO L290 TraceCheckUtils]: 193: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,067 INFO L290 TraceCheckUtils]: 194: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,068 INFO L290 TraceCheckUtils]: 195: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,068 INFO L290 TraceCheckUtils]: 196: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,068 INFO L290 TraceCheckUtils]: 197: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,069 INFO L290 TraceCheckUtils]: 198: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,069 INFO L290 TraceCheckUtils]: 199: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,069 INFO L290 TraceCheckUtils]: 200: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,070 INFO L290 TraceCheckUtils]: 201: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,070 INFO L290 TraceCheckUtils]: 202: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,070 INFO L290 TraceCheckUtils]: 203: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,071 INFO L290 TraceCheckUtils]: 204: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,071 INFO L290 TraceCheckUtils]: 205: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,071 INFO L290 TraceCheckUtils]: 206: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,072 INFO L290 TraceCheckUtils]: 207: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,072 INFO L290 TraceCheckUtils]: 208: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,072 INFO L290 TraceCheckUtils]: 209: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,073 INFO L290 TraceCheckUtils]: 210: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~j~0 < ~edgecount~0); {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:11,073 INFO L290 TraceCheckUtils]: 211: Hoare triple {28101#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28102#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:11,073 INFO L290 TraceCheckUtils]: 212: Hoare triple {28102#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-28 09:01:11,074 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-28 09:01:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-28 09:01:11,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:11,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246427202] [2022-04-28 09:01:11,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246427202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:11,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443551746] [2022-04-28 09:01:11,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:11,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:11,080 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:11,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 09:01:11,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:11,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:11,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:01:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:11,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:12,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-28 09:01:12,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-28 09:01:12,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-28 09:01:12,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-28 09:01:12,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-28 09:01:12,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {28122#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {28122#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {28122#(<= 5 main_~nodecount~0)} is VALID [2022-04-28 09:01:12,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {28122#(<= 5 main_~nodecount~0)} ~i~0 := 0; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,710 INFO L290 TraceCheckUtils]: 59: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,711 INFO L290 TraceCheckUtils]: 60: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,711 INFO L290 TraceCheckUtils]: 61: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,711 INFO L290 TraceCheckUtils]: 62: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,712 INFO L290 TraceCheckUtils]: 63: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,712 INFO L290 TraceCheckUtils]: 64: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,712 INFO L290 TraceCheckUtils]: 65: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,713 INFO L290 TraceCheckUtils]: 68: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,716 INFO L290 TraceCheckUtils]: 75: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,717 INFO L290 TraceCheckUtils]: 77: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,717 INFO L290 TraceCheckUtils]: 78: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,718 INFO L290 TraceCheckUtils]: 80: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,718 INFO L290 TraceCheckUtils]: 81: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,718 INFO L290 TraceCheckUtils]: 82: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,719 INFO L290 TraceCheckUtils]: 83: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,719 INFO L290 TraceCheckUtils]: 84: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,719 INFO L290 TraceCheckUtils]: 85: Hoare triple {28174#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,720 INFO L290 TraceCheckUtils]: 86: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,720 INFO L290 TraceCheckUtils]: 87: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,721 INFO L290 TraceCheckUtils]: 90: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,722 INFO L290 TraceCheckUtils]: 91: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,722 INFO L290 TraceCheckUtils]: 92: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,722 INFO L290 TraceCheckUtils]: 93: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,723 INFO L290 TraceCheckUtils]: 94: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,723 INFO L290 TraceCheckUtils]: 95: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,724 INFO L290 TraceCheckUtils]: 96: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,724 INFO L290 TraceCheckUtils]: 97: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,726 INFO L290 TraceCheckUtils]: 99: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,727 INFO L290 TraceCheckUtils]: 100: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,727 INFO L290 TraceCheckUtils]: 101: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,727 INFO L290 TraceCheckUtils]: 102: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,728 INFO L290 TraceCheckUtils]: 103: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,728 INFO L290 TraceCheckUtils]: 104: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,728 INFO L290 TraceCheckUtils]: 105: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,729 INFO L290 TraceCheckUtils]: 106: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,729 INFO L290 TraceCheckUtils]: 107: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,730 INFO L290 TraceCheckUtils]: 108: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,730 INFO L290 TraceCheckUtils]: 109: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,730 INFO L290 TraceCheckUtils]: 110: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,731 INFO L290 TraceCheckUtils]: 111: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,731 INFO L290 TraceCheckUtils]: 112: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,731 INFO L290 TraceCheckUtils]: 113: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,732 INFO L290 TraceCheckUtils]: 114: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,732 INFO L290 TraceCheckUtils]: 115: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,732 INFO L290 TraceCheckUtils]: 116: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,733 INFO L290 TraceCheckUtils]: 117: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,733 INFO L290 TraceCheckUtils]: 118: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,733 INFO L290 TraceCheckUtils]: 119: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,734 INFO L290 TraceCheckUtils]: 120: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,734 INFO L290 TraceCheckUtils]: 121: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,735 INFO L290 TraceCheckUtils]: 122: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,735 INFO L290 TraceCheckUtils]: 123: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,735 INFO L290 TraceCheckUtils]: 124: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,736 INFO L290 TraceCheckUtils]: 125: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,736 INFO L290 TraceCheckUtils]: 126: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,736 INFO L290 TraceCheckUtils]: 127: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,737 INFO L290 TraceCheckUtils]: 129: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,738 INFO L290 TraceCheckUtils]: 131: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,738 INFO L290 TraceCheckUtils]: 132: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,738 INFO L290 TraceCheckUtils]: 133: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,739 INFO L290 TraceCheckUtils]: 134: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,739 INFO L290 TraceCheckUtils]: 135: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,740 INFO L290 TraceCheckUtils]: 136: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,740 INFO L290 TraceCheckUtils]: 137: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,740 INFO L290 TraceCheckUtils]: 138: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,741 INFO L290 TraceCheckUtils]: 139: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,741 INFO L290 TraceCheckUtils]: 140: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,742 INFO L290 TraceCheckUtils]: 141: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,742 INFO L290 TraceCheckUtils]: 142: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,742 INFO L290 TraceCheckUtils]: 143: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,743 INFO L290 TraceCheckUtils]: 144: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,743 INFO L290 TraceCheckUtils]: 145: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,743 INFO L290 TraceCheckUtils]: 146: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,744 INFO L290 TraceCheckUtils]: 147: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,744 INFO L290 TraceCheckUtils]: 148: Hoare triple {28364#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,744 INFO L290 TraceCheckUtils]: 149: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,745 INFO L290 TraceCheckUtils]: 150: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,745 INFO L290 TraceCheckUtils]: 151: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,746 INFO L290 TraceCheckUtils]: 152: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,746 INFO L290 TraceCheckUtils]: 153: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,746 INFO L290 TraceCheckUtils]: 154: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,747 INFO L290 TraceCheckUtils]: 155: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,747 INFO L290 TraceCheckUtils]: 156: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,747 INFO L290 TraceCheckUtils]: 157: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,748 INFO L290 TraceCheckUtils]: 158: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,748 INFO L290 TraceCheckUtils]: 159: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,749 INFO L290 TraceCheckUtils]: 160: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,749 INFO L290 TraceCheckUtils]: 161: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,749 INFO L290 TraceCheckUtils]: 162: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,750 INFO L290 TraceCheckUtils]: 163: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,750 INFO L290 TraceCheckUtils]: 164: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,750 INFO L290 TraceCheckUtils]: 165: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,751 INFO L290 TraceCheckUtils]: 166: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,751 INFO L290 TraceCheckUtils]: 167: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,751 INFO L290 TraceCheckUtils]: 168: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,752 INFO L290 TraceCheckUtils]: 169: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,752 INFO L290 TraceCheckUtils]: 170: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,752 INFO L290 TraceCheckUtils]: 171: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,753 INFO L290 TraceCheckUtils]: 172: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,753 INFO L290 TraceCheckUtils]: 173: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,754 INFO L290 TraceCheckUtils]: 174: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,754 INFO L290 TraceCheckUtils]: 175: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,754 INFO L290 TraceCheckUtils]: 176: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,755 INFO L290 TraceCheckUtils]: 177: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,755 INFO L290 TraceCheckUtils]: 178: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,755 INFO L290 TraceCheckUtils]: 179: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,756 INFO L290 TraceCheckUtils]: 180: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,756 INFO L290 TraceCheckUtils]: 181: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,756 INFO L290 TraceCheckUtils]: 182: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,757 INFO L290 TraceCheckUtils]: 183: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,757 INFO L290 TraceCheckUtils]: 184: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,757 INFO L290 TraceCheckUtils]: 185: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,758 INFO L290 TraceCheckUtils]: 186: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,758 INFO L290 TraceCheckUtils]: 187: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,758 INFO L290 TraceCheckUtils]: 188: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,759 INFO L290 TraceCheckUtils]: 189: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,759 INFO L290 TraceCheckUtils]: 190: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,760 INFO L290 TraceCheckUtils]: 191: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,760 INFO L290 TraceCheckUtils]: 192: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,760 INFO L290 TraceCheckUtils]: 193: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,761 INFO L290 TraceCheckUtils]: 194: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,761 INFO L290 TraceCheckUtils]: 195: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,761 INFO L290 TraceCheckUtils]: 196: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,762 INFO L290 TraceCheckUtils]: 197: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,762 INFO L290 TraceCheckUtils]: 198: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,762 INFO L290 TraceCheckUtils]: 199: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,763 INFO L290 TraceCheckUtils]: 200: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,763 INFO L290 TraceCheckUtils]: 201: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,763 INFO L290 TraceCheckUtils]: 202: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,764 INFO L290 TraceCheckUtils]: 203: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,764 INFO L290 TraceCheckUtils]: 204: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,765 INFO L290 TraceCheckUtils]: 205: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,765 INFO L290 TraceCheckUtils]: 206: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,765 INFO L290 TraceCheckUtils]: 207: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,766 INFO L290 TraceCheckUtils]: 208: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,766 INFO L290 TraceCheckUtils]: 209: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,766 INFO L290 TraceCheckUtils]: 210: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 211: Hoare triple {28554#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28744#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 212: Hoare triple {28744#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-28 09:01:12,767 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-28 09:01:12,768 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-28 09:01:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-28 09:01:12,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:13,477 INFO L290 TraceCheckUtils]: 223: Hoare triple {28094#false} assume !false; {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 222: Hoare triple {28094#false} assume 0 == ~cond; {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 221: Hoare triple {28094#false} ~cond := #in~cond; {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L272 TraceCheckUtils]: 220: Hoare triple {28094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 219: Hoare triple {28094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 218: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 217: Hoare triple {28094#false} assume !(~i~0 < ~edgecount~0); {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 216: Hoare triple {28094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 215: Hoare triple {28094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 214: Hoare triple {28094#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 213: Hoare triple {28094#false} ~i~0 := 0; {28094#false} is VALID [2022-04-28 09:01:13,478 INFO L290 TraceCheckUtils]: 212: Hoare triple {28814#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {28094#false} is VALID [2022-04-28 09:01:13,479 INFO L290 TraceCheckUtils]: 211: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28814#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,479 INFO L290 TraceCheckUtils]: 210: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,479 INFO L290 TraceCheckUtils]: 209: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,480 INFO L290 TraceCheckUtils]: 208: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,480 INFO L290 TraceCheckUtils]: 207: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,480 INFO L290 TraceCheckUtils]: 206: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,480 INFO L290 TraceCheckUtils]: 205: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,480 INFO L290 TraceCheckUtils]: 204: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,481 INFO L290 TraceCheckUtils]: 203: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,481 INFO L290 TraceCheckUtils]: 202: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,481 INFO L290 TraceCheckUtils]: 201: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,481 INFO L290 TraceCheckUtils]: 200: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,482 INFO L290 TraceCheckUtils]: 199: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,482 INFO L290 TraceCheckUtils]: 198: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,482 INFO L290 TraceCheckUtils]: 197: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,482 INFO L290 TraceCheckUtils]: 196: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,483 INFO L290 TraceCheckUtils]: 195: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,483 INFO L290 TraceCheckUtils]: 194: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,483 INFO L290 TraceCheckUtils]: 193: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,483 INFO L290 TraceCheckUtils]: 192: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,484 INFO L290 TraceCheckUtils]: 191: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,484 INFO L290 TraceCheckUtils]: 190: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,484 INFO L290 TraceCheckUtils]: 189: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,484 INFO L290 TraceCheckUtils]: 188: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,484 INFO L290 TraceCheckUtils]: 187: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,485 INFO L290 TraceCheckUtils]: 186: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,485 INFO L290 TraceCheckUtils]: 185: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,485 INFO L290 TraceCheckUtils]: 184: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,485 INFO L290 TraceCheckUtils]: 183: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,486 INFO L290 TraceCheckUtils]: 182: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,486 INFO L290 TraceCheckUtils]: 181: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,486 INFO L290 TraceCheckUtils]: 180: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,486 INFO L290 TraceCheckUtils]: 179: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,487 INFO L290 TraceCheckUtils]: 178: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,487 INFO L290 TraceCheckUtils]: 177: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,487 INFO L290 TraceCheckUtils]: 176: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,487 INFO L290 TraceCheckUtils]: 175: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,488 INFO L290 TraceCheckUtils]: 174: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,488 INFO L290 TraceCheckUtils]: 173: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,488 INFO L290 TraceCheckUtils]: 172: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,488 INFO L290 TraceCheckUtils]: 171: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,488 INFO L290 TraceCheckUtils]: 170: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,489 INFO L290 TraceCheckUtils]: 169: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,489 INFO L290 TraceCheckUtils]: 168: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,489 INFO L290 TraceCheckUtils]: 167: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,489 INFO L290 TraceCheckUtils]: 166: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,490 INFO L290 TraceCheckUtils]: 165: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,490 INFO L290 TraceCheckUtils]: 164: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,490 INFO L290 TraceCheckUtils]: 163: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,490 INFO L290 TraceCheckUtils]: 162: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,491 INFO L290 TraceCheckUtils]: 161: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,491 INFO L290 TraceCheckUtils]: 160: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,491 INFO L290 TraceCheckUtils]: 159: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,491 INFO L290 TraceCheckUtils]: 158: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,491 INFO L290 TraceCheckUtils]: 157: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,492 INFO L290 TraceCheckUtils]: 156: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,492 INFO L290 TraceCheckUtils]: 155: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,492 INFO L290 TraceCheckUtils]: 154: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,492 INFO L290 TraceCheckUtils]: 153: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,493 INFO L290 TraceCheckUtils]: 152: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,493 INFO L290 TraceCheckUtils]: 151: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,493 INFO L290 TraceCheckUtils]: 150: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,493 INFO L290 TraceCheckUtils]: 149: Hoare triple {28818#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,494 INFO L290 TraceCheckUtils]: 148: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {28818#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,494 INFO L290 TraceCheckUtils]: 147: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,494 INFO L290 TraceCheckUtils]: 146: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,494 INFO L290 TraceCheckUtils]: 145: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,495 INFO L290 TraceCheckUtils]: 144: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,495 INFO L290 TraceCheckUtils]: 143: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,495 INFO L290 TraceCheckUtils]: 142: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,495 INFO L290 TraceCheckUtils]: 141: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,496 INFO L290 TraceCheckUtils]: 140: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,496 INFO L290 TraceCheckUtils]: 139: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,496 INFO L290 TraceCheckUtils]: 138: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,496 INFO L290 TraceCheckUtils]: 137: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,497 INFO L290 TraceCheckUtils]: 136: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,497 INFO L290 TraceCheckUtils]: 135: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,497 INFO L290 TraceCheckUtils]: 134: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,497 INFO L290 TraceCheckUtils]: 133: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,497 INFO L290 TraceCheckUtils]: 132: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,498 INFO L290 TraceCheckUtils]: 131: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,498 INFO L290 TraceCheckUtils]: 130: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,498 INFO L290 TraceCheckUtils]: 129: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,498 INFO L290 TraceCheckUtils]: 128: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,499 INFO L290 TraceCheckUtils]: 127: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,499 INFO L290 TraceCheckUtils]: 126: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,499 INFO L290 TraceCheckUtils]: 125: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,499 INFO L290 TraceCheckUtils]: 124: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,500 INFO L290 TraceCheckUtils]: 123: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,500 INFO L290 TraceCheckUtils]: 122: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,500 INFO L290 TraceCheckUtils]: 121: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,500 INFO L290 TraceCheckUtils]: 120: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,501 INFO L290 TraceCheckUtils]: 119: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,501 INFO L290 TraceCheckUtils]: 118: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,501 INFO L290 TraceCheckUtils]: 117: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,502 INFO L290 TraceCheckUtils]: 116: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,502 INFO L290 TraceCheckUtils]: 115: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,502 INFO L290 TraceCheckUtils]: 114: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,502 INFO L290 TraceCheckUtils]: 113: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,503 INFO L290 TraceCheckUtils]: 112: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,503 INFO L290 TraceCheckUtils]: 111: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,503 INFO L290 TraceCheckUtils]: 110: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,504 INFO L290 TraceCheckUtils]: 109: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,504 INFO L290 TraceCheckUtils]: 108: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,504 INFO L290 TraceCheckUtils]: 107: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,504 INFO L290 TraceCheckUtils]: 106: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,505 INFO L290 TraceCheckUtils]: 105: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,505 INFO L290 TraceCheckUtils]: 104: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,505 INFO L290 TraceCheckUtils]: 103: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,505 INFO L290 TraceCheckUtils]: 102: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,506 INFO L290 TraceCheckUtils]: 101: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,506 INFO L290 TraceCheckUtils]: 100: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,506 INFO L290 TraceCheckUtils]: 99: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,506 INFO L290 TraceCheckUtils]: 98: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,506 INFO L290 TraceCheckUtils]: 97: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,507 INFO L290 TraceCheckUtils]: 96: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,507 INFO L290 TraceCheckUtils]: 95: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,507 INFO L290 TraceCheckUtils]: 94: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,507 INFO L290 TraceCheckUtils]: 93: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,508 INFO L290 TraceCheckUtils]: 92: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,509 INFO L290 TraceCheckUtils]: 87: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,509 INFO L290 TraceCheckUtils]: 86: Hoare triple {29008#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,509 INFO L290 TraceCheckUtils]: 85: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {29008#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,511 INFO L290 TraceCheckUtils]: 80: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,511 INFO L290 TraceCheckUtils]: 79: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,511 INFO L290 TraceCheckUtils]: 78: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,511 INFO L290 TraceCheckUtils]: 77: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,512 INFO L290 TraceCheckUtils]: 76: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,512 INFO L290 TraceCheckUtils]: 73: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,513 INFO L290 TraceCheckUtils]: 71: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,513 INFO L290 TraceCheckUtils]: 70: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,513 INFO L290 TraceCheckUtils]: 69: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,514 INFO L290 TraceCheckUtils]: 67: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,514 INFO L290 TraceCheckUtils]: 66: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,514 INFO L290 TraceCheckUtils]: 65: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,514 INFO L290 TraceCheckUtils]: 64: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {29198#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {29388#(< 3 main_~nodecount~0)} ~i~0 := 0; {29198#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-28 09:01:13,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {29388#(< 3 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {29388#(< 3 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {29388#(< 3 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {28093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {29388#(< 3 main_~nodecount~0)} is VALID [2022-04-28 09:01:13,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {28093#true} call #t~ret22 := main(); {28093#true} is VALID [2022-04-28 09:01:13,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28093#true} {28093#true} #107#return; {28093#true} is VALID [2022-04-28 09:01:13,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {28093#true} assume true; {28093#true} is VALID [2022-04-28 09:01:13,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {28093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28093#true} is VALID [2022-04-28 09:01:13,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {28093#true} call ULTIMATE.init(); {28093#true} is VALID [2022-04-28 09:01:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5538 backedges. 0 proven. 3732 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-04-28 09:01:13,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443551746] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:13,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:13,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-28 09:01:13,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:13,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765835088] [2022-04-28 09:01:13,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765835088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:13,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:13,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:01:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107995538] [2022-04-28 09:01:13,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:13,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-28 09:01:13,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:13,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:13,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:13,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:01:13,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:13,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:01:13,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:01:13,573 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:15,301 INFO L93 Difference]: Finished difference Result 400 states and 518 transitions. [2022-04-28 09:01:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:01:15,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-28 09:01:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-28 09:01:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-28 09:01:15,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-28 09:01:15,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:15,403 INFO L225 Difference]: With dead ends: 400 [2022-04-28 09:01:15,403 INFO L226 Difference]: Without dead ends: 384 [2022-04-28 09:01:15,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:01:15,403 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:15,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 34 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:01:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-28 09:01:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 292. [2022-04-28 09:01:16,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:16,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:16,400 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:16,400 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:16,405 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-28 09:01:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-28 09:01:16,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:16,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:16,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 384 states. [2022-04-28 09:01:16,406 INFO L87 Difference]: Start difference. First operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 384 states. [2022-04-28 09:01:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:16,413 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-28 09:01:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2022-04-28 09:01:16,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:16,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:16,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:16,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 286 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 380 transitions. [2022-04-28 09:01:16,418 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 380 transitions. Word has length 224 [2022-04-28 09:01:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:16,418 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 380 transitions. [2022-04-28 09:01:16,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:16,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 380 transitions. [2022-04-28 09:01:17,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 380 transitions. [2022-04-28 09:01:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-04-28 09:01:17,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:17,062 INFO L195 NwaCegarLoop]: trace histogram [80, 80, 80, 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, 1, 1] [2022-04-28 09:01:17,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:17,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:17,263 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:17,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 51 times [2022-04-28 09:01:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:17,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1659328633] [2022-04-28 09:01:17,266 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:17,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:17,266 INFO L85 PathProgramCache]: Analyzing trace with hash -381796264, now seen corresponding path program 52 times [2022-04-28 09:01:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:17,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437222844] [2022-04-28 09:01:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:17,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-28 09:01:17,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 09:01:17,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-28 09:01:17,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:17,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {31630#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-28 09:01:17,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 09:01:17,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-28 09:01:17,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-28 09:01:17,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {31624#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-28 09:01:17,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {31624#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,575 INFO L290 TraceCheckUtils]: 69: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,575 INFO L290 TraceCheckUtils]: 70: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,575 INFO L290 TraceCheckUtils]: 71: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,576 INFO L290 TraceCheckUtils]: 72: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,576 INFO L290 TraceCheckUtils]: 74: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,577 INFO L290 TraceCheckUtils]: 75: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,577 INFO L290 TraceCheckUtils]: 76: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,578 INFO L290 TraceCheckUtils]: 77: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,578 INFO L290 TraceCheckUtils]: 78: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,578 INFO L290 TraceCheckUtils]: 79: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,579 INFO L290 TraceCheckUtils]: 80: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,579 INFO L290 TraceCheckUtils]: 81: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,579 INFO L290 TraceCheckUtils]: 82: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,580 INFO L290 TraceCheckUtils]: 83: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,580 INFO L290 TraceCheckUtils]: 84: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:17,580 INFO L290 TraceCheckUtils]: 85: Hoare triple {31625#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,580 INFO L290 TraceCheckUtils]: 86: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,581 INFO L290 TraceCheckUtils]: 87: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,581 INFO L290 TraceCheckUtils]: 88: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,581 INFO L290 TraceCheckUtils]: 89: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,582 INFO L290 TraceCheckUtils]: 90: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,582 INFO L290 TraceCheckUtils]: 91: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,582 INFO L290 TraceCheckUtils]: 92: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,583 INFO L290 TraceCheckUtils]: 93: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,583 INFO L290 TraceCheckUtils]: 94: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,583 INFO L290 TraceCheckUtils]: 95: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,584 INFO L290 TraceCheckUtils]: 96: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,584 INFO L290 TraceCheckUtils]: 97: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,584 INFO L290 TraceCheckUtils]: 98: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,585 INFO L290 TraceCheckUtils]: 99: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,585 INFO L290 TraceCheckUtils]: 100: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,586 INFO L290 TraceCheckUtils]: 101: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,586 INFO L290 TraceCheckUtils]: 102: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,586 INFO L290 TraceCheckUtils]: 103: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,587 INFO L290 TraceCheckUtils]: 104: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,587 INFO L290 TraceCheckUtils]: 105: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,587 INFO L290 TraceCheckUtils]: 106: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,588 INFO L290 TraceCheckUtils]: 107: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,588 INFO L290 TraceCheckUtils]: 108: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,588 INFO L290 TraceCheckUtils]: 109: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,589 INFO L290 TraceCheckUtils]: 110: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,589 INFO L290 TraceCheckUtils]: 111: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,589 INFO L290 TraceCheckUtils]: 112: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,590 INFO L290 TraceCheckUtils]: 113: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,590 INFO L290 TraceCheckUtils]: 114: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,590 INFO L290 TraceCheckUtils]: 115: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,591 INFO L290 TraceCheckUtils]: 116: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,591 INFO L290 TraceCheckUtils]: 117: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,591 INFO L290 TraceCheckUtils]: 118: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,592 INFO L290 TraceCheckUtils]: 119: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,592 INFO L290 TraceCheckUtils]: 120: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,592 INFO L290 TraceCheckUtils]: 121: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,593 INFO L290 TraceCheckUtils]: 122: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,593 INFO L290 TraceCheckUtils]: 123: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,594 INFO L290 TraceCheckUtils]: 124: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,594 INFO L290 TraceCheckUtils]: 125: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,594 INFO L290 TraceCheckUtils]: 126: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,595 INFO L290 TraceCheckUtils]: 127: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,595 INFO L290 TraceCheckUtils]: 128: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,595 INFO L290 TraceCheckUtils]: 129: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,596 INFO L290 TraceCheckUtils]: 130: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,596 INFO L290 TraceCheckUtils]: 131: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,596 INFO L290 TraceCheckUtils]: 132: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,597 INFO L290 TraceCheckUtils]: 133: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,597 INFO L290 TraceCheckUtils]: 134: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,597 INFO L290 TraceCheckUtils]: 135: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,598 INFO L290 TraceCheckUtils]: 136: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,598 INFO L290 TraceCheckUtils]: 137: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,598 INFO L290 TraceCheckUtils]: 138: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,599 INFO L290 TraceCheckUtils]: 139: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,599 INFO L290 TraceCheckUtils]: 140: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,599 INFO L290 TraceCheckUtils]: 141: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,600 INFO L290 TraceCheckUtils]: 142: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,600 INFO L290 TraceCheckUtils]: 143: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,601 INFO L290 TraceCheckUtils]: 144: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,601 INFO L290 TraceCheckUtils]: 145: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,601 INFO L290 TraceCheckUtils]: 146: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,601 INFO L290 TraceCheckUtils]: 147: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,602 INFO L290 TraceCheckUtils]: 148: Hoare triple {31626#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,602 INFO L290 TraceCheckUtils]: 149: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,603 INFO L290 TraceCheckUtils]: 150: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,603 INFO L290 TraceCheckUtils]: 151: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,603 INFO L290 TraceCheckUtils]: 152: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,604 INFO L290 TraceCheckUtils]: 153: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,604 INFO L290 TraceCheckUtils]: 154: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,604 INFO L290 TraceCheckUtils]: 155: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,605 INFO L290 TraceCheckUtils]: 156: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,605 INFO L290 TraceCheckUtils]: 157: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,605 INFO L290 TraceCheckUtils]: 158: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,606 INFO L290 TraceCheckUtils]: 159: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,606 INFO L290 TraceCheckUtils]: 160: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,606 INFO L290 TraceCheckUtils]: 161: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,607 INFO L290 TraceCheckUtils]: 162: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,607 INFO L290 TraceCheckUtils]: 163: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,607 INFO L290 TraceCheckUtils]: 164: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,608 INFO L290 TraceCheckUtils]: 165: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,608 INFO L290 TraceCheckUtils]: 166: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,608 INFO L290 TraceCheckUtils]: 167: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,609 INFO L290 TraceCheckUtils]: 168: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,609 INFO L290 TraceCheckUtils]: 169: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,609 INFO L290 TraceCheckUtils]: 170: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,610 INFO L290 TraceCheckUtils]: 171: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,610 INFO L290 TraceCheckUtils]: 172: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,610 INFO L290 TraceCheckUtils]: 173: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,611 INFO L290 TraceCheckUtils]: 174: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,611 INFO L290 TraceCheckUtils]: 175: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,612 INFO L290 TraceCheckUtils]: 176: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,612 INFO L290 TraceCheckUtils]: 177: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,612 INFO L290 TraceCheckUtils]: 178: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,613 INFO L290 TraceCheckUtils]: 179: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,613 INFO L290 TraceCheckUtils]: 180: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,613 INFO L290 TraceCheckUtils]: 181: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,614 INFO L290 TraceCheckUtils]: 182: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,614 INFO L290 TraceCheckUtils]: 183: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,614 INFO L290 TraceCheckUtils]: 184: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,615 INFO L290 TraceCheckUtils]: 185: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,615 INFO L290 TraceCheckUtils]: 186: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,615 INFO L290 TraceCheckUtils]: 187: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,616 INFO L290 TraceCheckUtils]: 188: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,616 INFO L290 TraceCheckUtils]: 189: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,616 INFO L290 TraceCheckUtils]: 190: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,617 INFO L290 TraceCheckUtils]: 191: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,617 INFO L290 TraceCheckUtils]: 192: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,617 INFO L290 TraceCheckUtils]: 193: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,618 INFO L290 TraceCheckUtils]: 194: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,618 INFO L290 TraceCheckUtils]: 195: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,618 INFO L290 TraceCheckUtils]: 196: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,619 INFO L290 TraceCheckUtils]: 197: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,619 INFO L290 TraceCheckUtils]: 198: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,619 INFO L290 TraceCheckUtils]: 199: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,620 INFO L290 TraceCheckUtils]: 200: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,620 INFO L290 TraceCheckUtils]: 201: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,621 INFO L290 TraceCheckUtils]: 202: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,621 INFO L290 TraceCheckUtils]: 203: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,621 INFO L290 TraceCheckUtils]: 204: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,622 INFO L290 TraceCheckUtils]: 205: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,622 INFO L290 TraceCheckUtils]: 206: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,622 INFO L290 TraceCheckUtils]: 207: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,623 INFO L290 TraceCheckUtils]: 208: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,623 INFO L290 TraceCheckUtils]: 209: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,623 INFO L290 TraceCheckUtils]: 210: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~j~0 < ~edgecount~0); {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:17,624 INFO L290 TraceCheckUtils]: 211: Hoare triple {31627#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,624 INFO L290 TraceCheckUtils]: 212: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,624 INFO L290 TraceCheckUtils]: 213: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,625 INFO L290 TraceCheckUtils]: 214: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,625 INFO L290 TraceCheckUtils]: 215: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,625 INFO L290 TraceCheckUtils]: 216: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,626 INFO L290 TraceCheckUtils]: 217: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,626 INFO L290 TraceCheckUtils]: 218: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,626 INFO L290 TraceCheckUtils]: 219: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,627 INFO L290 TraceCheckUtils]: 220: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,627 INFO L290 TraceCheckUtils]: 221: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,627 INFO L290 TraceCheckUtils]: 222: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,628 INFO L290 TraceCheckUtils]: 223: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,628 INFO L290 TraceCheckUtils]: 224: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,628 INFO L290 TraceCheckUtils]: 225: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,629 INFO L290 TraceCheckUtils]: 226: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,629 INFO L290 TraceCheckUtils]: 227: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,629 INFO L290 TraceCheckUtils]: 228: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,630 INFO L290 TraceCheckUtils]: 229: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,630 INFO L290 TraceCheckUtils]: 230: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,631 INFO L290 TraceCheckUtils]: 231: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,631 INFO L290 TraceCheckUtils]: 232: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,631 INFO L290 TraceCheckUtils]: 233: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,632 INFO L290 TraceCheckUtils]: 234: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,632 INFO L290 TraceCheckUtils]: 235: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,632 INFO L290 TraceCheckUtils]: 236: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,633 INFO L290 TraceCheckUtils]: 237: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,633 INFO L290 TraceCheckUtils]: 238: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,633 INFO L290 TraceCheckUtils]: 239: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,634 INFO L290 TraceCheckUtils]: 240: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,634 INFO L290 TraceCheckUtils]: 241: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,634 INFO L290 TraceCheckUtils]: 242: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,635 INFO L290 TraceCheckUtils]: 243: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,635 INFO L290 TraceCheckUtils]: 244: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,635 INFO L290 TraceCheckUtils]: 245: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,636 INFO L290 TraceCheckUtils]: 246: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,636 INFO L290 TraceCheckUtils]: 247: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,636 INFO L290 TraceCheckUtils]: 248: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,647 INFO L290 TraceCheckUtils]: 249: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,648 INFO L290 TraceCheckUtils]: 250: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,648 INFO L290 TraceCheckUtils]: 251: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,648 INFO L290 TraceCheckUtils]: 252: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,649 INFO L290 TraceCheckUtils]: 253: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,649 INFO L290 TraceCheckUtils]: 254: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,649 INFO L290 TraceCheckUtils]: 255: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,650 INFO L290 TraceCheckUtils]: 256: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,650 INFO L290 TraceCheckUtils]: 257: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,650 INFO L290 TraceCheckUtils]: 258: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,651 INFO L290 TraceCheckUtils]: 259: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,651 INFO L290 TraceCheckUtils]: 260: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,651 INFO L290 TraceCheckUtils]: 261: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,652 INFO L290 TraceCheckUtils]: 262: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,652 INFO L290 TraceCheckUtils]: 263: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,652 INFO L290 TraceCheckUtils]: 264: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,653 INFO L290 TraceCheckUtils]: 265: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,653 INFO L290 TraceCheckUtils]: 266: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,653 INFO L290 TraceCheckUtils]: 267: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,654 INFO L290 TraceCheckUtils]: 268: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,654 INFO L290 TraceCheckUtils]: 269: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,654 INFO L290 TraceCheckUtils]: 270: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,655 INFO L290 TraceCheckUtils]: 271: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,655 INFO L290 TraceCheckUtils]: 272: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,655 INFO L290 TraceCheckUtils]: 273: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~j~0 < ~edgecount~0); {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 274: Hoare triple {31628#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31629#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 275: Hoare triple {31629#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 276: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 277: Hoare triple {31620#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 278: Hoare triple {31620#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 279: Hoare triple {31620#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 280: Hoare triple {31620#false} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-28 09:01:17,656 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-28 09:01:17,657 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-28 09:01:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2396 trivial. 0 not checked. [2022-04-28 09:01:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:17,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437222844] [2022-04-28 09:01:17,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437222844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:17,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378789695] [2022-04-28 09:01:17,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:01:17,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:17,661 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:17,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 09:01:18,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:01:18,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:18,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 09:01:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:18,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:19,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:19,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31703#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:19,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {31703#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31703#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:19,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {31703#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31703#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:19,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {31703#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31713#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:19,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {31713#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31713#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:19,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {31713#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31713#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:19,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {31713#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31723#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:19,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {31723#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31723#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:19,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {31723#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31723#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:19,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {31723#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31733#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:19,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {31733#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31733#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:19,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {31733#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31733#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:19,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {31733#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31743#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:19,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {31743#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31743#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:19,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {31743#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31743#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:19,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {31743#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31753#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:19,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {31753#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31753#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:19,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {31753#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31753#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:19,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {31753#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31763#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:19,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {31763#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31763#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:19,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {31763#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31763#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:19,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {31763#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31773#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:19,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {31773#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31773#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:19,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {31773#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31773#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:19,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {31773#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31783#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:19,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {31783#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31783#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:19,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {31783#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31783#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:19,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {31783#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31793#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:19,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {31793#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31793#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:19,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {31793#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31793#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:19,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {31793#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31803#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:19,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {31803#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31803#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:19,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {31803#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31803#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:19,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {31803#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31813#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:19,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {31813#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31813#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:19,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {31813#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31813#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:19,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {31813#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31823#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:19,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {31823#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31823#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:19,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {31823#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31823#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:19,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {31823#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31833#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:19,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {31833#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31833#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:19,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {31833#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31833#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:19,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {31833#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31843#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:19,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {31843#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31843#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:19,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {31843#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31843#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:19,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {31843#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31853#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:19,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {31853#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31853#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:19,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {31853#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31853#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:19,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {31853#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31863#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:19,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {31863#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31863#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:19,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {31863#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31863#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:19,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {31863#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31873#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:19,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {31873#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31873#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:19,199 INFO L290 TraceCheckUtils]: 76: Hoare triple {31873#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31873#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:19,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {31873#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31883#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:19,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {31883#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31883#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:19,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {31883#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31883#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:19,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {31883#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31893#(<= 19 main_~j~0)} is VALID [2022-04-28 09:01:19,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {31893#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,201 INFO L290 TraceCheckUtils]: 85: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,202 INFO L290 TraceCheckUtils]: 88: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,202 INFO L290 TraceCheckUtils]: 89: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,203 INFO L290 TraceCheckUtils]: 91: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,203 INFO L290 TraceCheckUtils]: 92: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,204 INFO L290 TraceCheckUtils]: 94: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,204 INFO L290 TraceCheckUtils]: 95: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,204 INFO L290 TraceCheckUtils]: 96: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,205 INFO L290 TraceCheckUtils]: 99: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,205 INFO L290 TraceCheckUtils]: 100: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,205 INFO L290 TraceCheckUtils]: 101: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,205 INFO L290 TraceCheckUtils]: 102: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,206 INFO L290 TraceCheckUtils]: 103: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,206 INFO L290 TraceCheckUtils]: 104: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,206 INFO L290 TraceCheckUtils]: 105: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,207 INFO L290 TraceCheckUtils]: 106: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,207 INFO L290 TraceCheckUtils]: 107: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,207 INFO L290 TraceCheckUtils]: 108: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,207 INFO L290 TraceCheckUtils]: 109: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,207 INFO L290 TraceCheckUtils]: 110: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,208 INFO L290 TraceCheckUtils]: 111: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,208 INFO L290 TraceCheckUtils]: 112: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,208 INFO L290 TraceCheckUtils]: 113: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,208 INFO L290 TraceCheckUtils]: 114: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,210 INFO L290 TraceCheckUtils]: 115: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,210 INFO L290 TraceCheckUtils]: 116: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,211 INFO L290 TraceCheckUtils]: 117: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,211 INFO L290 TraceCheckUtils]: 118: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,211 INFO L290 TraceCheckUtils]: 119: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,211 INFO L290 TraceCheckUtils]: 120: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,211 INFO L290 TraceCheckUtils]: 121: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,212 INFO L290 TraceCheckUtils]: 122: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,212 INFO L290 TraceCheckUtils]: 123: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,212 INFO L290 TraceCheckUtils]: 124: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,212 INFO L290 TraceCheckUtils]: 125: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,213 INFO L290 TraceCheckUtils]: 126: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,213 INFO L290 TraceCheckUtils]: 127: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,213 INFO L290 TraceCheckUtils]: 128: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,213 INFO L290 TraceCheckUtils]: 129: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,213 INFO L290 TraceCheckUtils]: 130: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,214 INFO L290 TraceCheckUtils]: 131: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,214 INFO L290 TraceCheckUtils]: 132: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,214 INFO L290 TraceCheckUtils]: 133: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,214 INFO L290 TraceCheckUtils]: 134: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,215 INFO L290 TraceCheckUtils]: 135: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,215 INFO L290 TraceCheckUtils]: 136: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,215 INFO L290 TraceCheckUtils]: 137: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,215 INFO L290 TraceCheckUtils]: 138: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,216 INFO L290 TraceCheckUtils]: 139: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,216 INFO L290 TraceCheckUtils]: 140: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,216 INFO L290 TraceCheckUtils]: 141: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,216 INFO L290 TraceCheckUtils]: 142: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,217 INFO L290 TraceCheckUtils]: 143: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,217 INFO L290 TraceCheckUtils]: 144: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,217 INFO L290 TraceCheckUtils]: 145: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,217 INFO L290 TraceCheckUtils]: 146: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,217 INFO L290 TraceCheckUtils]: 147: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,218 INFO L290 TraceCheckUtils]: 148: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,218 INFO L290 TraceCheckUtils]: 149: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,218 INFO L290 TraceCheckUtils]: 150: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,218 INFO L290 TraceCheckUtils]: 151: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,219 INFO L290 TraceCheckUtils]: 152: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,219 INFO L290 TraceCheckUtils]: 153: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,219 INFO L290 TraceCheckUtils]: 154: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,219 INFO L290 TraceCheckUtils]: 155: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,219 INFO L290 TraceCheckUtils]: 156: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,220 INFO L290 TraceCheckUtils]: 157: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,220 INFO L290 TraceCheckUtils]: 158: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,220 INFO L290 TraceCheckUtils]: 159: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,220 INFO L290 TraceCheckUtils]: 160: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,221 INFO L290 TraceCheckUtils]: 161: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,221 INFO L290 TraceCheckUtils]: 162: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,221 INFO L290 TraceCheckUtils]: 163: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,221 INFO L290 TraceCheckUtils]: 164: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,222 INFO L290 TraceCheckUtils]: 165: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,222 INFO L290 TraceCheckUtils]: 166: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,222 INFO L290 TraceCheckUtils]: 167: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,222 INFO L290 TraceCheckUtils]: 168: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,222 INFO L290 TraceCheckUtils]: 169: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,223 INFO L290 TraceCheckUtils]: 170: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,223 INFO L290 TraceCheckUtils]: 171: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,223 INFO L290 TraceCheckUtils]: 172: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,223 INFO L290 TraceCheckUtils]: 173: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,224 INFO L290 TraceCheckUtils]: 174: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,224 INFO L290 TraceCheckUtils]: 175: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,224 INFO L290 TraceCheckUtils]: 176: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,224 INFO L290 TraceCheckUtils]: 177: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,225 INFO L290 TraceCheckUtils]: 178: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,225 INFO L290 TraceCheckUtils]: 179: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,225 INFO L290 TraceCheckUtils]: 180: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,225 INFO L290 TraceCheckUtils]: 181: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,225 INFO L290 TraceCheckUtils]: 182: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,226 INFO L290 TraceCheckUtils]: 183: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,226 INFO L290 TraceCheckUtils]: 184: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,226 INFO L290 TraceCheckUtils]: 185: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,226 INFO L290 TraceCheckUtils]: 186: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,227 INFO L290 TraceCheckUtils]: 187: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,227 INFO L290 TraceCheckUtils]: 188: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,227 INFO L290 TraceCheckUtils]: 189: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,227 INFO L290 TraceCheckUtils]: 190: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,228 INFO L290 TraceCheckUtils]: 191: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,228 INFO L290 TraceCheckUtils]: 192: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,228 INFO L290 TraceCheckUtils]: 193: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,228 INFO L290 TraceCheckUtils]: 194: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,228 INFO L290 TraceCheckUtils]: 195: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,229 INFO L290 TraceCheckUtils]: 196: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,229 INFO L290 TraceCheckUtils]: 197: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,229 INFO L290 TraceCheckUtils]: 198: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,229 INFO L290 TraceCheckUtils]: 199: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,230 INFO L290 TraceCheckUtils]: 200: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,230 INFO L290 TraceCheckUtils]: 201: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,230 INFO L290 TraceCheckUtils]: 202: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,230 INFO L290 TraceCheckUtils]: 203: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,231 INFO L290 TraceCheckUtils]: 204: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,231 INFO L290 TraceCheckUtils]: 205: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,231 INFO L290 TraceCheckUtils]: 206: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,231 INFO L290 TraceCheckUtils]: 207: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,231 INFO L290 TraceCheckUtils]: 208: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,232 INFO L290 TraceCheckUtils]: 209: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,232 INFO L290 TraceCheckUtils]: 210: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,232 INFO L290 TraceCheckUtils]: 211: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,232 INFO L290 TraceCheckUtils]: 212: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,233 INFO L290 TraceCheckUtils]: 213: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,233 INFO L290 TraceCheckUtils]: 214: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,233 INFO L290 TraceCheckUtils]: 215: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,233 INFO L290 TraceCheckUtils]: 216: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,233 INFO L290 TraceCheckUtils]: 217: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,234 INFO L290 TraceCheckUtils]: 218: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,234 INFO L290 TraceCheckUtils]: 219: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,234 INFO L290 TraceCheckUtils]: 220: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,234 INFO L290 TraceCheckUtils]: 221: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,235 INFO L290 TraceCheckUtils]: 222: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,235 INFO L290 TraceCheckUtils]: 223: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,235 INFO L290 TraceCheckUtils]: 224: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,235 INFO L290 TraceCheckUtils]: 225: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,236 INFO L290 TraceCheckUtils]: 226: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,236 INFO L290 TraceCheckUtils]: 227: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,236 INFO L290 TraceCheckUtils]: 228: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,236 INFO L290 TraceCheckUtils]: 229: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,236 INFO L290 TraceCheckUtils]: 230: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,237 INFO L290 TraceCheckUtils]: 231: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,237 INFO L290 TraceCheckUtils]: 232: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,237 INFO L290 TraceCheckUtils]: 233: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,237 INFO L290 TraceCheckUtils]: 234: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,238 INFO L290 TraceCheckUtils]: 235: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,238 INFO L290 TraceCheckUtils]: 236: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,238 INFO L290 TraceCheckUtils]: 237: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,238 INFO L290 TraceCheckUtils]: 238: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,239 INFO L290 TraceCheckUtils]: 239: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,239 INFO L290 TraceCheckUtils]: 240: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,239 INFO L290 TraceCheckUtils]: 241: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,239 INFO L290 TraceCheckUtils]: 242: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,239 INFO L290 TraceCheckUtils]: 243: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,240 INFO L290 TraceCheckUtils]: 244: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,240 INFO L290 TraceCheckUtils]: 245: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,240 INFO L290 TraceCheckUtils]: 246: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,240 INFO L290 TraceCheckUtils]: 247: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,241 INFO L290 TraceCheckUtils]: 248: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,241 INFO L290 TraceCheckUtils]: 249: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,241 INFO L290 TraceCheckUtils]: 250: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,241 INFO L290 TraceCheckUtils]: 251: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,242 INFO L290 TraceCheckUtils]: 252: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,242 INFO L290 TraceCheckUtils]: 253: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,242 INFO L290 TraceCheckUtils]: 254: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,242 INFO L290 TraceCheckUtils]: 255: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,242 INFO L290 TraceCheckUtils]: 256: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,243 INFO L290 TraceCheckUtils]: 257: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,243 INFO L290 TraceCheckUtils]: 258: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,243 INFO L290 TraceCheckUtils]: 259: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,243 INFO L290 TraceCheckUtils]: 260: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,244 INFO L290 TraceCheckUtils]: 261: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,244 INFO L290 TraceCheckUtils]: 262: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,244 INFO L290 TraceCheckUtils]: 263: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,244 INFO L290 TraceCheckUtils]: 264: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,245 INFO L290 TraceCheckUtils]: 265: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,245 INFO L290 TraceCheckUtils]: 266: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,245 INFO L290 TraceCheckUtils]: 267: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,245 INFO L290 TraceCheckUtils]: 268: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,245 INFO L290 TraceCheckUtils]: 269: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,246 INFO L290 TraceCheckUtils]: 270: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,246 INFO L290 TraceCheckUtils]: 271: Hoare triple {31897#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,246 INFO L290 TraceCheckUtils]: 272: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,246 INFO L290 TraceCheckUtils]: 273: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,247 INFO L290 TraceCheckUtils]: 274: Hoare triple {31897#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,247 INFO L290 TraceCheckUtils]: 275: Hoare triple {31897#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {31897#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:19,247 INFO L290 TraceCheckUtils]: 276: Hoare triple {31897#(< 19 main_~edgecount~0)} ~i~0 := 0; {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:19,248 INFO L290 TraceCheckUtils]: 277: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:19,248 INFO L290 TraceCheckUtils]: 278: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:19,248 INFO L290 TraceCheckUtils]: 279: Hoare triple {32483#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32493#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:01:19,249 INFO L290 TraceCheckUtils]: 280: Hoare triple {32493#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-28 09:01:19,249 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-28 09:01:19,249 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-28 09:01:19,249 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-28 09:01:19,249 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-28 09:01:19,249 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-28 09:01:19,249 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-28 09:01:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 536 proven. 3599 refuted. 0 times theorem prover too weak. 5723 trivial. 0 not checked. [2022-04-28 09:01:19,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:20,329 INFO L290 TraceCheckUtils]: 286: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-28 09:01:20,329 INFO L290 TraceCheckUtils]: 285: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-28 09:01:20,329 INFO L290 TraceCheckUtils]: 284: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-28 09:01:20,329 INFO L272 TraceCheckUtils]: 283: Hoare triple {31620#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {31620#false} is VALID [2022-04-28 09:01:20,329 INFO L290 TraceCheckUtils]: 282: Hoare triple {31620#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31620#false} is VALID [2022-04-28 09:01:20,329 INFO L290 TraceCheckUtils]: 281: Hoare triple {31620#false} ~i~0 := 0; {31620#false} is VALID [2022-04-28 09:01:20,329 INFO L290 TraceCheckUtils]: 280: Hoare triple {32533#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {31620#false} is VALID [2022-04-28 09:01:20,330 INFO L290 TraceCheckUtils]: 279: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32533#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,330 INFO L290 TraceCheckUtils]: 278: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:20,330 INFO L290 TraceCheckUtils]: 277: Hoare triple {32537#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:20,331 INFO L290 TraceCheckUtils]: 276: Hoare triple {32547#(< 1 main_~edgecount~0)} ~i~0 := 0; {32537#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:20,331 INFO L290 TraceCheckUtils]: 275: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,331 INFO L290 TraceCheckUtils]: 274: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,331 INFO L290 TraceCheckUtils]: 273: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,332 INFO L290 TraceCheckUtils]: 272: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,332 INFO L290 TraceCheckUtils]: 271: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,332 INFO L290 TraceCheckUtils]: 270: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,332 INFO L290 TraceCheckUtils]: 269: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,333 INFO L290 TraceCheckUtils]: 268: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,333 INFO L290 TraceCheckUtils]: 267: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,333 INFO L290 TraceCheckUtils]: 266: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,333 INFO L290 TraceCheckUtils]: 265: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,334 INFO L290 TraceCheckUtils]: 264: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,334 INFO L290 TraceCheckUtils]: 263: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,334 INFO L290 TraceCheckUtils]: 262: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,335 INFO L290 TraceCheckUtils]: 261: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,335 INFO L290 TraceCheckUtils]: 260: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,335 INFO L290 TraceCheckUtils]: 259: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,335 INFO L290 TraceCheckUtils]: 258: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,336 INFO L290 TraceCheckUtils]: 257: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,336 INFO L290 TraceCheckUtils]: 256: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,336 INFO L290 TraceCheckUtils]: 255: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,336 INFO L290 TraceCheckUtils]: 254: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,337 INFO L290 TraceCheckUtils]: 253: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,337 INFO L290 TraceCheckUtils]: 252: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,337 INFO L290 TraceCheckUtils]: 251: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,337 INFO L290 TraceCheckUtils]: 250: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,337 INFO L290 TraceCheckUtils]: 249: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,338 INFO L290 TraceCheckUtils]: 248: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,338 INFO L290 TraceCheckUtils]: 247: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,338 INFO L290 TraceCheckUtils]: 246: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,338 INFO L290 TraceCheckUtils]: 245: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,339 INFO L290 TraceCheckUtils]: 244: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,339 INFO L290 TraceCheckUtils]: 243: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,339 INFO L290 TraceCheckUtils]: 242: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,339 INFO L290 TraceCheckUtils]: 241: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,340 INFO L290 TraceCheckUtils]: 240: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,340 INFO L290 TraceCheckUtils]: 239: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,340 INFO L290 TraceCheckUtils]: 238: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,340 INFO L290 TraceCheckUtils]: 237: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,340 INFO L290 TraceCheckUtils]: 236: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,341 INFO L290 TraceCheckUtils]: 235: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,341 INFO L290 TraceCheckUtils]: 234: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,341 INFO L290 TraceCheckUtils]: 233: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,341 INFO L290 TraceCheckUtils]: 232: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,342 INFO L290 TraceCheckUtils]: 231: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,342 INFO L290 TraceCheckUtils]: 230: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,342 INFO L290 TraceCheckUtils]: 229: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,342 INFO L290 TraceCheckUtils]: 228: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,342 INFO L290 TraceCheckUtils]: 227: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,343 INFO L290 TraceCheckUtils]: 226: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,343 INFO L290 TraceCheckUtils]: 225: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,343 INFO L290 TraceCheckUtils]: 224: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,343 INFO L290 TraceCheckUtils]: 223: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,344 INFO L290 TraceCheckUtils]: 222: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,344 INFO L290 TraceCheckUtils]: 221: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,344 INFO L290 TraceCheckUtils]: 220: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,344 INFO L290 TraceCheckUtils]: 219: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,345 INFO L290 TraceCheckUtils]: 218: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,345 INFO L290 TraceCheckUtils]: 217: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,345 INFO L290 TraceCheckUtils]: 216: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,345 INFO L290 TraceCheckUtils]: 215: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,345 INFO L290 TraceCheckUtils]: 214: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,346 INFO L290 TraceCheckUtils]: 213: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,346 INFO L290 TraceCheckUtils]: 212: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,346 INFO L290 TraceCheckUtils]: 211: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,346 INFO L290 TraceCheckUtils]: 210: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,347 INFO L290 TraceCheckUtils]: 209: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,347 INFO L290 TraceCheckUtils]: 208: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,347 INFO L290 TraceCheckUtils]: 207: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,347 INFO L290 TraceCheckUtils]: 206: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,348 INFO L290 TraceCheckUtils]: 205: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,348 INFO L290 TraceCheckUtils]: 204: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,348 INFO L290 TraceCheckUtils]: 203: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,348 INFO L290 TraceCheckUtils]: 202: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,349 INFO L290 TraceCheckUtils]: 201: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,349 INFO L290 TraceCheckUtils]: 200: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,349 INFO L290 TraceCheckUtils]: 199: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,349 INFO L290 TraceCheckUtils]: 198: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,349 INFO L290 TraceCheckUtils]: 197: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,350 INFO L290 TraceCheckUtils]: 196: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,350 INFO L290 TraceCheckUtils]: 195: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,350 INFO L290 TraceCheckUtils]: 194: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,350 INFO L290 TraceCheckUtils]: 193: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,351 INFO L290 TraceCheckUtils]: 192: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,351 INFO L290 TraceCheckUtils]: 191: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,351 INFO L290 TraceCheckUtils]: 190: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,351 INFO L290 TraceCheckUtils]: 189: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,351 INFO L290 TraceCheckUtils]: 188: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,352 INFO L290 TraceCheckUtils]: 187: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,352 INFO L290 TraceCheckUtils]: 186: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,352 INFO L290 TraceCheckUtils]: 185: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,352 INFO L290 TraceCheckUtils]: 184: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,353 INFO L290 TraceCheckUtils]: 183: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,353 INFO L290 TraceCheckUtils]: 182: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,353 INFO L290 TraceCheckUtils]: 181: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,353 INFO L290 TraceCheckUtils]: 180: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,354 INFO L290 TraceCheckUtils]: 179: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,354 INFO L290 TraceCheckUtils]: 178: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,354 INFO L290 TraceCheckUtils]: 177: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,354 INFO L290 TraceCheckUtils]: 176: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,354 INFO L290 TraceCheckUtils]: 175: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,355 INFO L290 TraceCheckUtils]: 174: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,355 INFO L290 TraceCheckUtils]: 173: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,355 INFO L290 TraceCheckUtils]: 172: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,355 INFO L290 TraceCheckUtils]: 171: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,356 INFO L290 TraceCheckUtils]: 170: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,356 INFO L290 TraceCheckUtils]: 169: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,356 INFO L290 TraceCheckUtils]: 168: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,356 INFO L290 TraceCheckUtils]: 167: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,356 INFO L290 TraceCheckUtils]: 166: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,357 INFO L290 TraceCheckUtils]: 165: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,357 INFO L290 TraceCheckUtils]: 164: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,357 INFO L290 TraceCheckUtils]: 163: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,357 INFO L290 TraceCheckUtils]: 162: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,358 INFO L290 TraceCheckUtils]: 161: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,358 INFO L290 TraceCheckUtils]: 160: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,358 INFO L290 TraceCheckUtils]: 159: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,358 INFO L290 TraceCheckUtils]: 158: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,359 INFO L290 TraceCheckUtils]: 157: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,359 INFO L290 TraceCheckUtils]: 156: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,359 INFO L290 TraceCheckUtils]: 155: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,359 INFO L290 TraceCheckUtils]: 154: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,359 INFO L290 TraceCheckUtils]: 153: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,360 INFO L290 TraceCheckUtils]: 152: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,360 INFO L290 TraceCheckUtils]: 151: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,360 INFO L290 TraceCheckUtils]: 150: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,360 INFO L290 TraceCheckUtils]: 149: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,361 INFO L290 TraceCheckUtils]: 148: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,361 INFO L290 TraceCheckUtils]: 147: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,361 INFO L290 TraceCheckUtils]: 146: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,361 INFO L290 TraceCheckUtils]: 145: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,362 INFO L290 TraceCheckUtils]: 144: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,362 INFO L290 TraceCheckUtils]: 143: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,362 INFO L290 TraceCheckUtils]: 142: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,362 INFO L290 TraceCheckUtils]: 141: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,362 INFO L290 TraceCheckUtils]: 140: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,363 INFO L290 TraceCheckUtils]: 139: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,363 INFO L290 TraceCheckUtils]: 138: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,363 INFO L290 TraceCheckUtils]: 137: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,363 INFO L290 TraceCheckUtils]: 136: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,364 INFO L290 TraceCheckUtils]: 135: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,364 INFO L290 TraceCheckUtils]: 134: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,364 INFO L290 TraceCheckUtils]: 133: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,364 INFO L290 TraceCheckUtils]: 132: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,365 INFO L290 TraceCheckUtils]: 131: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,365 INFO L290 TraceCheckUtils]: 130: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,365 INFO L290 TraceCheckUtils]: 129: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,365 INFO L290 TraceCheckUtils]: 128: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,366 INFO L290 TraceCheckUtils]: 127: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,366 INFO L290 TraceCheckUtils]: 126: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,366 INFO L290 TraceCheckUtils]: 125: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,366 INFO L290 TraceCheckUtils]: 124: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,366 INFO L290 TraceCheckUtils]: 123: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,367 INFO L290 TraceCheckUtils]: 122: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,367 INFO L290 TraceCheckUtils]: 120: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,367 INFO L290 TraceCheckUtils]: 119: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,368 INFO L290 TraceCheckUtils]: 118: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,368 INFO L290 TraceCheckUtils]: 117: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,368 INFO L290 TraceCheckUtils]: 116: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,368 INFO L290 TraceCheckUtils]: 115: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,369 INFO L290 TraceCheckUtils]: 114: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,369 INFO L290 TraceCheckUtils]: 113: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,369 INFO L290 TraceCheckUtils]: 112: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,369 INFO L290 TraceCheckUtils]: 111: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,370 INFO L290 TraceCheckUtils]: 110: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,370 INFO L290 TraceCheckUtils]: 109: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,370 INFO L290 TraceCheckUtils]: 108: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,370 INFO L290 TraceCheckUtils]: 107: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,370 INFO L290 TraceCheckUtils]: 106: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,371 INFO L290 TraceCheckUtils]: 104: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,371 INFO L290 TraceCheckUtils]: 103: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,371 INFO L290 TraceCheckUtils]: 102: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,372 INFO L290 TraceCheckUtils]: 101: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,372 INFO L290 TraceCheckUtils]: 100: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,372 INFO L290 TraceCheckUtils]: 99: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,372 INFO L290 TraceCheckUtils]: 98: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,373 INFO L290 TraceCheckUtils]: 97: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,373 INFO L290 TraceCheckUtils]: 96: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,373 INFO L290 TraceCheckUtils]: 95: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,373 INFO L290 TraceCheckUtils]: 94: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,373 INFO L290 TraceCheckUtils]: 93: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,375 INFO L290 TraceCheckUtils]: 87: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,375 INFO L290 TraceCheckUtils]: 86: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,375 INFO L290 TraceCheckUtils]: 85: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {32547#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,376 INFO L290 TraceCheckUtils]: 83: Hoare triple {32547#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {32547#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,377 INFO L290 TraceCheckUtils]: 81: Hoare triple {31713#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32547#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:20,377 INFO L290 TraceCheckUtils]: 80: Hoare triple {31703#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31713#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:20,377 INFO L290 TraceCheckUtils]: 79: Hoare triple {31703#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {31703#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:20,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {31703#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {31703#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:20,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {31703#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:20,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:20,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {33145#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:20,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33145#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:20,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:20,379 INFO L290 TraceCheckUtils]: 72: Hoare triple {33155#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:20,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33155#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:20,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:20,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {33165#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:20,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33165#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:20,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:20,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {33175#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:20,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33175#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:20,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:20,382 INFO L290 TraceCheckUtils]: 63: Hoare triple {33185#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:20,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33185#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:20,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:20,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {33195#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:20,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33195#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:20,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:20,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {33205#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:20,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33205#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:20,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:20,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {33215#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:20,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33215#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:20,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:20,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {33225#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:20,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33225#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:20,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:20,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {33235#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:20,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33235#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:20,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:20,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {33245#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:20,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33245#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:20,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:20,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {33255#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:20,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33255#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:20,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:20,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {33265#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:20,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33265#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:20,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:20,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {33275#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:20,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33275#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:20,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:20,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {33285#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:20,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33285#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:20,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:20,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {33295#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:20,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33295#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:20,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-28 09:01:20,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {33305#(<= 0 (+ main_~j~0 17))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-28 09:01:20,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {33305#(<= 0 (+ main_~j~0 17))} is VALID [2022-04-28 09:01:20,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-28 09:01:20,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {33315#(<= 0 (+ main_~j~0 18))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-28 09:01:20,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {33315#(<= 0 (+ main_~j~0 18))} is VALID [2022-04-28 09:01:20,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {31619#true} ~i~0 := 0; {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {31619#true} assume !(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {31619#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} assume !!(~i~0 < ~nodecount~0); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret22 := main(); {31619#true} is VALID [2022-04-28 09:01:20,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #107#return; {31619#true} is VALID [2022-04-28 09:01:20,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 09:01:20,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {31619#true} is VALID [2022-04-28 09:01:20,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-28 09:01:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 536 proven. 3599 refuted. 0 times theorem prover too weak. 5723 trivial. 0 not checked. [2022-04-28 09:01:20,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378789695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:20,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:20,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 25] total 53 [2022-04-28 09:01:20,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:20,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1659328633] [2022-04-28 09:01:20,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1659328633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:20,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:20,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:01:20,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466996707] [2022-04-28 09:01:20,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:20,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 287 [2022-04-28 09:01:20,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:20,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:20,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:20,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:01:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:01:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 09:01:20,429 INFO L87 Difference]: Start difference. First operand 292 states and 380 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:22,263 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2022-04-28 09:01:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:01:22,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 287 [2022-04-28 09:01:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-28 09:01:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-04-28 09:01:22,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 139 transitions. [2022-04-28 09:01:22,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:22,374 INFO L225 Difference]: With dead ends: 406 [2022-04-28 09:01:22,374 INFO L226 Difference]: Without dead ends: 390 [2022-04-28 09:01:22,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=886, Invalid=2536, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 09:01:22,375 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 206 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:22,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 39 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-28 09:01:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 355. [2022-04-28 09:01:23,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:23,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:23,701 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:23,702 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:23,708 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-28 09:01:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-28 09:01:23,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:23,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:23,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-04-28 09:01:23,709 INFO L87 Difference]: Start difference. First operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-04-28 09:01:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:23,715 INFO L93 Difference]: Finished difference Result 390 states and 507 transitions. [2022-04-28 09:01:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 507 transitions. [2022-04-28 09:01:23,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:23,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:23,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:23,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 349 states have (on average 1.3151862464183381) internal successors, (459), 349 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 464 transitions. [2022-04-28 09:01:23,721 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 464 transitions. Word has length 287 [2022-04-28 09:01:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:23,722 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 464 transitions. [2022-04-28 09:01:23,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:23,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 464 transitions. [2022-04-28 09:01:24,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 464 transitions. [2022-04-28 09:01:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2022-04-28 09:01:24,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:24,554 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 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, 1, 1] [2022-04-28 09:01:24,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:24,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:24,755 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 53 times [2022-04-28 09:01:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [931911396] [2022-04-28 09:01:24,759 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:24,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 587258522, now seen corresponding path program 54 times [2022-04-28 09:01:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:24,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478321584] [2022-04-28 09:01:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:25,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-28 09:01:25,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-28 09:01:25,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-28 09:01:25,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:25,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {35718#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-28 09:01:25,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-28 09:01:25,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-28 09:01:25,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-28 09:01:25,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,059 INFO L290 TraceCheckUtils]: 66: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,059 INFO L290 TraceCheckUtils]: 67: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,059 INFO L290 TraceCheckUtils]: 70: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,061 INFO L290 TraceCheckUtils]: 75: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,061 INFO L290 TraceCheckUtils]: 76: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,061 INFO L290 TraceCheckUtils]: 77: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,061 INFO L290 TraceCheckUtils]: 78: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,062 INFO L290 TraceCheckUtils]: 80: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,062 INFO L290 TraceCheckUtils]: 81: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,062 INFO L290 TraceCheckUtils]: 82: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,062 INFO L290 TraceCheckUtils]: 83: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,063 INFO L290 TraceCheckUtils]: 84: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,063 INFO L290 TraceCheckUtils]: 85: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,063 INFO L290 TraceCheckUtils]: 86: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,063 INFO L290 TraceCheckUtils]: 87: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,063 INFO L290 TraceCheckUtils]: 88: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,064 INFO L290 TraceCheckUtils]: 90: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,064 INFO L290 TraceCheckUtils]: 91: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,064 INFO L290 TraceCheckUtils]: 92: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,065 INFO L290 TraceCheckUtils]: 94: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,065 INFO L290 TraceCheckUtils]: 95: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,065 INFO L290 TraceCheckUtils]: 96: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,065 INFO L290 TraceCheckUtils]: 97: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,066 INFO L290 TraceCheckUtils]: 98: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,066 INFO L290 TraceCheckUtils]: 99: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,066 INFO L290 TraceCheckUtils]: 101: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,067 INFO L290 TraceCheckUtils]: 102: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,067 INFO L290 TraceCheckUtils]: 103: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,067 INFO L290 TraceCheckUtils]: 104: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,067 INFO L290 TraceCheckUtils]: 105: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,067 INFO L290 TraceCheckUtils]: 106: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,068 INFO L290 TraceCheckUtils]: 107: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,068 INFO L290 TraceCheckUtils]: 108: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,068 INFO L290 TraceCheckUtils]: 109: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,068 INFO L290 TraceCheckUtils]: 110: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,069 INFO L290 TraceCheckUtils]: 111: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,069 INFO L290 TraceCheckUtils]: 112: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,069 INFO L290 TraceCheckUtils]: 113: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,069 INFO L290 TraceCheckUtils]: 114: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,069 INFO L290 TraceCheckUtils]: 115: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,070 INFO L290 TraceCheckUtils]: 116: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,070 INFO L290 TraceCheckUtils]: 117: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,070 INFO L290 TraceCheckUtils]: 118: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,070 INFO L290 TraceCheckUtils]: 119: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,071 INFO L290 TraceCheckUtils]: 120: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,071 INFO L290 TraceCheckUtils]: 121: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,071 INFO L290 TraceCheckUtils]: 122: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,071 INFO L290 TraceCheckUtils]: 123: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,071 INFO L290 TraceCheckUtils]: 124: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,072 INFO L290 TraceCheckUtils]: 125: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,072 INFO L290 TraceCheckUtils]: 126: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,072 INFO L290 TraceCheckUtils]: 127: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,072 INFO L290 TraceCheckUtils]: 128: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,073 INFO L290 TraceCheckUtils]: 129: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,073 INFO L290 TraceCheckUtils]: 130: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,073 INFO L290 TraceCheckUtils]: 131: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,073 INFO L290 TraceCheckUtils]: 132: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,073 INFO L290 TraceCheckUtils]: 133: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,074 INFO L290 TraceCheckUtils]: 134: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,074 INFO L290 TraceCheckUtils]: 135: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,074 INFO L290 TraceCheckUtils]: 136: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,074 INFO L290 TraceCheckUtils]: 137: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,074 INFO L290 TraceCheckUtils]: 138: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,075 INFO L290 TraceCheckUtils]: 139: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,075 INFO L290 TraceCheckUtils]: 140: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,075 INFO L290 TraceCheckUtils]: 141: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,075 INFO L290 TraceCheckUtils]: 142: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,076 INFO L290 TraceCheckUtils]: 143: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,076 INFO L290 TraceCheckUtils]: 144: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,076 INFO L290 TraceCheckUtils]: 145: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,076 INFO L290 TraceCheckUtils]: 146: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,077 INFO L290 TraceCheckUtils]: 147: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,077 INFO L290 TraceCheckUtils]: 148: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,077 INFO L290 TraceCheckUtils]: 149: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,077 INFO L290 TraceCheckUtils]: 150: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,077 INFO L290 TraceCheckUtils]: 151: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,078 INFO L290 TraceCheckUtils]: 152: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,078 INFO L290 TraceCheckUtils]: 153: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,078 INFO L290 TraceCheckUtils]: 154: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,078 INFO L290 TraceCheckUtils]: 155: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,078 INFO L290 TraceCheckUtils]: 156: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,079 INFO L290 TraceCheckUtils]: 157: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,079 INFO L290 TraceCheckUtils]: 158: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,079 INFO L290 TraceCheckUtils]: 159: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,079 INFO L290 TraceCheckUtils]: 160: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,080 INFO L290 TraceCheckUtils]: 161: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,080 INFO L290 TraceCheckUtils]: 162: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,080 INFO L290 TraceCheckUtils]: 163: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,080 INFO L290 TraceCheckUtils]: 164: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,080 INFO L290 TraceCheckUtils]: 165: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,081 INFO L290 TraceCheckUtils]: 166: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,081 INFO L290 TraceCheckUtils]: 167: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,081 INFO L290 TraceCheckUtils]: 168: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,081 INFO L290 TraceCheckUtils]: 169: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,082 INFO L290 TraceCheckUtils]: 170: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,082 INFO L290 TraceCheckUtils]: 171: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,082 INFO L290 TraceCheckUtils]: 172: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,082 INFO L290 TraceCheckUtils]: 173: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,082 INFO L290 TraceCheckUtils]: 174: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,083 INFO L290 TraceCheckUtils]: 175: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,083 INFO L290 TraceCheckUtils]: 176: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,083 INFO L290 TraceCheckUtils]: 177: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,083 INFO L290 TraceCheckUtils]: 178: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,084 INFO L290 TraceCheckUtils]: 179: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,084 INFO L290 TraceCheckUtils]: 180: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,084 INFO L290 TraceCheckUtils]: 181: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,084 INFO L290 TraceCheckUtils]: 182: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,084 INFO L290 TraceCheckUtils]: 183: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,085 INFO L290 TraceCheckUtils]: 184: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,085 INFO L290 TraceCheckUtils]: 185: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,085 INFO L290 TraceCheckUtils]: 186: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,085 INFO L290 TraceCheckUtils]: 187: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,086 INFO L290 TraceCheckUtils]: 188: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,086 INFO L290 TraceCheckUtils]: 189: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,086 INFO L290 TraceCheckUtils]: 190: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,086 INFO L290 TraceCheckUtils]: 191: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,086 INFO L290 TraceCheckUtils]: 192: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,087 INFO L290 TraceCheckUtils]: 193: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,087 INFO L290 TraceCheckUtils]: 194: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,087 INFO L290 TraceCheckUtils]: 195: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,087 INFO L290 TraceCheckUtils]: 196: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,088 INFO L290 TraceCheckUtils]: 197: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,088 INFO L290 TraceCheckUtils]: 198: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,088 INFO L290 TraceCheckUtils]: 199: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,088 INFO L290 TraceCheckUtils]: 200: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,088 INFO L290 TraceCheckUtils]: 201: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,089 INFO L290 TraceCheckUtils]: 202: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,089 INFO L290 TraceCheckUtils]: 203: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,089 INFO L290 TraceCheckUtils]: 204: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,089 INFO L290 TraceCheckUtils]: 205: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,090 INFO L290 TraceCheckUtils]: 206: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,090 INFO L290 TraceCheckUtils]: 207: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,090 INFO L290 TraceCheckUtils]: 208: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,090 INFO L290 TraceCheckUtils]: 209: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,090 INFO L290 TraceCheckUtils]: 210: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,091 INFO L290 TraceCheckUtils]: 211: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,091 INFO L290 TraceCheckUtils]: 212: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,091 INFO L290 TraceCheckUtils]: 213: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,091 INFO L290 TraceCheckUtils]: 214: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,091 INFO L290 TraceCheckUtils]: 215: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,092 INFO L290 TraceCheckUtils]: 216: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,092 INFO L290 TraceCheckUtils]: 217: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,092 INFO L290 TraceCheckUtils]: 218: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,092 INFO L290 TraceCheckUtils]: 219: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,093 INFO L290 TraceCheckUtils]: 220: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,093 INFO L290 TraceCheckUtils]: 221: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,093 INFO L290 TraceCheckUtils]: 222: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,093 INFO L290 TraceCheckUtils]: 223: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,093 INFO L290 TraceCheckUtils]: 224: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,094 INFO L290 TraceCheckUtils]: 225: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,094 INFO L290 TraceCheckUtils]: 226: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,094 INFO L290 TraceCheckUtils]: 227: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,094 INFO L290 TraceCheckUtils]: 228: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,095 INFO L290 TraceCheckUtils]: 229: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,095 INFO L290 TraceCheckUtils]: 230: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,095 INFO L290 TraceCheckUtils]: 231: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,095 INFO L290 TraceCheckUtils]: 232: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,095 INFO L290 TraceCheckUtils]: 233: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,096 INFO L290 TraceCheckUtils]: 234: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,096 INFO L290 TraceCheckUtils]: 235: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,096 INFO L290 TraceCheckUtils]: 236: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,096 INFO L290 TraceCheckUtils]: 237: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,097 INFO L290 TraceCheckUtils]: 238: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,097 INFO L290 TraceCheckUtils]: 239: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,097 INFO L290 TraceCheckUtils]: 240: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,097 INFO L290 TraceCheckUtils]: 241: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,097 INFO L290 TraceCheckUtils]: 242: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,098 INFO L290 TraceCheckUtils]: 243: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,098 INFO L290 TraceCheckUtils]: 244: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,098 INFO L290 TraceCheckUtils]: 245: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,098 INFO L290 TraceCheckUtils]: 246: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,099 INFO L290 TraceCheckUtils]: 247: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,099 INFO L290 TraceCheckUtils]: 248: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,099 INFO L290 TraceCheckUtils]: 249: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,099 INFO L290 TraceCheckUtils]: 250: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,099 INFO L290 TraceCheckUtils]: 251: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,100 INFO L290 TraceCheckUtils]: 252: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,100 INFO L290 TraceCheckUtils]: 253: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,100 INFO L290 TraceCheckUtils]: 254: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,100 INFO L290 TraceCheckUtils]: 255: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,101 INFO L290 TraceCheckUtils]: 256: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,101 INFO L290 TraceCheckUtils]: 257: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,101 INFO L290 TraceCheckUtils]: 258: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,101 INFO L290 TraceCheckUtils]: 259: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,101 INFO L290 TraceCheckUtils]: 260: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,102 INFO L290 TraceCheckUtils]: 261: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,102 INFO L290 TraceCheckUtils]: 262: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,102 INFO L290 TraceCheckUtils]: 263: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,102 INFO L290 TraceCheckUtils]: 264: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,102 INFO L290 TraceCheckUtils]: 265: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,103 INFO L290 TraceCheckUtils]: 266: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,103 INFO L290 TraceCheckUtils]: 267: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,103 INFO L290 TraceCheckUtils]: 268: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,103 INFO L290 TraceCheckUtils]: 269: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,104 INFO L290 TraceCheckUtils]: 270: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,104 INFO L290 TraceCheckUtils]: 271: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,104 INFO L290 TraceCheckUtils]: 272: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,104 INFO L290 TraceCheckUtils]: 273: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,104 INFO L290 TraceCheckUtils]: 274: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,105 INFO L290 TraceCheckUtils]: 275: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,105 INFO L290 TraceCheckUtils]: 276: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,105 INFO L290 TraceCheckUtils]: 277: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,105 INFO L290 TraceCheckUtils]: 278: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,106 INFO L290 TraceCheckUtils]: 279: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,106 INFO L290 TraceCheckUtils]: 280: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,106 INFO L290 TraceCheckUtils]: 281: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,106 INFO L290 TraceCheckUtils]: 282: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,106 INFO L290 TraceCheckUtils]: 283: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,107 INFO L290 TraceCheckUtils]: 284: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,107 INFO L290 TraceCheckUtils]: 285: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,107 INFO L290 TraceCheckUtils]: 286: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,107 INFO L290 TraceCheckUtils]: 287: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,108 INFO L290 TraceCheckUtils]: 288: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,108 INFO L290 TraceCheckUtils]: 289: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,108 INFO L290 TraceCheckUtils]: 290: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,108 INFO L290 TraceCheckUtils]: 291: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,108 INFO L290 TraceCheckUtils]: 292: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,109 INFO L290 TraceCheckUtils]: 293: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,109 INFO L290 TraceCheckUtils]: 294: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,109 INFO L290 TraceCheckUtils]: 295: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,109 INFO L290 TraceCheckUtils]: 296: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,109 INFO L290 TraceCheckUtils]: 297: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,110 INFO L290 TraceCheckUtils]: 298: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,110 INFO L290 TraceCheckUtils]: 299: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,110 INFO L290 TraceCheckUtils]: 300: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,110 INFO L290 TraceCheckUtils]: 301: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,111 INFO L290 TraceCheckUtils]: 302: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,111 INFO L290 TraceCheckUtils]: 303: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,111 INFO L290 TraceCheckUtils]: 304: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,111 INFO L290 TraceCheckUtils]: 305: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,111 INFO L290 TraceCheckUtils]: 306: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,112 INFO L290 TraceCheckUtils]: 307: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,112 INFO L290 TraceCheckUtils]: 308: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,112 INFO L290 TraceCheckUtils]: 309: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,112 INFO L290 TraceCheckUtils]: 310: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,112 INFO L290 TraceCheckUtils]: 311: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,113 INFO L290 TraceCheckUtils]: 312: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,113 INFO L290 TraceCheckUtils]: 313: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,113 INFO L290 TraceCheckUtils]: 314: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,113 INFO L290 TraceCheckUtils]: 315: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,114 INFO L290 TraceCheckUtils]: 316: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,114 INFO L290 TraceCheckUtils]: 317: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,114 INFO L290 TraceCheckUtils]: 318: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,114 INFO L290 TraceCheckUtils]: 319: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,114 INFO L290 TraceCheckUtils]: 320: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,115 INFO L290 TraceCheckUtils]: 321: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,115 INFO L290 TraceCheckUtils]: 322: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,115 INFO L290 TraceCheckUtils]: 323: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,115 INFO L290 TraceCheckUtils]: 324: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,116 INFO L290 TraceCheckUtils]: 325: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,116 INFO L290 TraceCheckUtils]: 326: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,116 INFO L290 TraceCheckUtils]: 327: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,116 INFO L290 TraceCheckUtils]: 328: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,116 INFO L290 TraceCheckUtils]: 329: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,117 INFO L290 TraceCheckUtils]: 330: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,117 INFO L290 TraceCheckUtils]: 331: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,117 INFO L290 TraceCheckUtils]: 332: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,117 INFO L290 TraceCheckUtils]: 333: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,118 INFO L290 TraceCheckUtils]: 334: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,118 INFO L290 TraceCheckUtils]: 335: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,118 INFO L290 TraceCheckUtils]: 336: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,118 INFO L290 TraceCheckUtils]: 337: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,118 INFO L290 TraceCheckUtils]: 338: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {35715#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:25,119 INFO L290 TraceCheckUtils]: 339: Hoare triple {35715#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:25,119 INFO L290 TraceCheckUtils]: 340: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:25,120 INFO L290 TraceCheckUtils]: 341: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:25,120 INFO L290 TraceCheckUtils]: 342: Hoare triple {35716#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {35717#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:01:25,120 INFO L290 TraceCheckUtils]: 343: Hoare triple {35717#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-28 09:01:25,120 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-28 09:01:25,120 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-28 09:01:25,120 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-28 09:01:25,121 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-28 09:01:25,121 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-28 09:01:25,121 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-28 09:01:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:25,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478321584] [2022-04-28 09:01:25,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478321584] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:25,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742798953] [2022-04-28 09:01:25,122 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:01:25,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:25,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:25,123 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:25,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 09:01:25,442 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:01:25,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:25,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:01:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:25,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:26,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-28 09:01:26,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-28 09:01:26,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-28 09:01:26,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-28 09:01:26,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-28 09:01:26,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {35737#(<= 20 main_~edgecount~0)} ~i~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,578 INFO L290 TraceCheckUtils]: 58: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,578 INFO L290 TraceCheckUtils]: 59: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,579 INFO L290 TraceCheckUtils]: 61: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,579 INFO L290 TraceCheckUtils]: 63: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,579 INFO L290 TraceCheckUtils]: 64: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,580 INFO L290 TraceCheckUtils]: 65: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,580 INFO L290 TraceCheckUtils]: 66: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,580 INFO L290 TraceCheckUtils]: 67: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,580 INFO L290 TraceCheckUtils]: 68: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,581 INFO L290 TraceCheckUtils]: 73: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,582 INFO L290 TraceCheckUtils]: 77: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,583 INFO L290 TraceCheckUtils]: 78: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,583 INFO L290 TraceCheckUtils]: 80: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,583 INFO L290 TraceCheckUtils]: 81: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,585 INFO L290 TraceCheckUtils]: 86: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,585 INFO L290 TraceCheckUtils]: 87: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,585 INFO L290 TraceCheckUtils]: 88: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,585 INFO L290 TraceCheckUtils]: 89: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,586 INFO L290 TraceCheckUtils]: 90: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,586 INFO L290 TraceCheckUtils]: 91: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,586 INFO L290 TraceCheckUtils]: 92: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,586 INFO L290 TraceCheckUtils]: 93: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,586 INFO L290 TraceCheckUtils]: 94: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,587 INFO L290 TraceCheckUtils]: 95: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,587 INFO L290 TraceCheckUtils]: 96: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,588 INFO L290 TraceCheckUtils]: 99: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,588 INFO L290 TraceCheckUtils]: 101: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,588 INFO L290 TraceCheckUtils]: 102: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,589 INFO L290 TraceCheckUtils]: 103: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,589 INFO L290 TraceCheckUtils]: 104: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,589 INFO L290 TraceCheckUtils]: 105: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,589 INFO L290 TraceCheckUtils]: 106: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,590 INFO L290 TraceCheckUtils]: 107: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,590 INFO L290 TraceCheckUtils]: 108: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,590 INFO L290 TraceCheckUtils]: 109: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,590 INFO L290 TraceCheckUtils]: 110: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,590 INFO L290 TraceCheckUtils]: 111: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,591 INFO L290 TraceCheckUtils]: 112: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,591 INFO L290 TraceCheckUtils]: 113: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,591 INFO L290 TraceCheckUtils]: 114: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,591 INFO L290 TraceCheckUtils]: 115: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,592 INFO L290 TraceCheckUtils]: 116: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,592 INFO L290 TraceCheckUtils]: 117: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,592 INFO L290 TraceCheckUtils]: 118: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,592 INFO L290 TraceCheckUtils]: 119: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,593 INFO L290 TraceCheckUtils]: 120: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,593 INFO L290 TraceCheckUtils]: 121: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,593 INFO L290 TraceCheckUtils]: 122: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,593 INFO L290 TraceCheckUtils]: 123: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,593 INFO L290 TraceCheckUtils]: 124: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,594 INFO L290 TraceCheckUtils]: 125: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,594 INFO L290 TraceCheckUtils]: 126: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,594 INFO L290 TraceCheckUtils]: 127: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,594 INFO L290 TraceCheckUtils]: 128: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,595 INFO L290 TraceCheckUtils]: 129: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,595 INFO L290 TraceCheckUtils]: 130: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,595 INFO L290 TraceCheckUtils]: 131: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,595 INFO L290 TraceCheckUtils]: 132: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,596 INFO L290 TraceCheckUtils]: 133: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,596 INFO L290 TraceCheckUtils]: 134: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,596 INFO L290 TraceCheckUtils]: 135: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,596 INFO L290 TraceCheckUtils]: 136: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,597 INFO L290 TraceCheckUtils]: 137: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,597 INFO L290 TraceCheckUtils]: 138: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,597 INFO L290 TraceCheckUtils]: 139: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,597 INFO L290 TraceCheckUtils]: 140: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,597 INFO L290 TraceCheckUtils]: 141: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,598 INFO L290 TraceCheckUtils]: 142: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,598 INFO L290 TraceCheckUtils]: 143: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,598 INFO L290 TraceCheckUtils]: 144: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,598 INFO L290 TraceCheckUtils]: 145: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,599 INFO L290 TraceCheckUtils]: 146: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,599 INFO L290 TraceCheckUtils]: 147: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,599 INFO L290 TraceCheckUtils]: 148: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,599 INFO L290 TraceCheckUtils]: 149: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,600 INFO L290 TraceCheckUtils]: 150: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,600 INFO L290 TraceCheckUtils]: 151: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,600 INFO L290 TraceCheckUtils]: 152: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,600 INFO L290 TraceCheckUtils]: 153: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,600 INFO L290 TraceCheckUtils]: 154: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,601 INFO L290 TraceCheckUtils]: 155: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,601 INFO L290 TraceCheckUtils]: 156: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,601 INFO L290 TraceCheckUtils]: 157: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,601 INFO L290 TraceCheckUtils]: 158: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,602 INFO L290 TraceCheckUtils]: 159: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,602 INFO L290 TraceCheckUtils]: 160: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,602 INFO L290 TraceCheckUtils]: 161: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,602 INFO L290 TraceCheckUtils]: 162: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,603 INFO L290 TraceCheckUtils]: 163: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,603 INFO L290 TraceCheckUtils]: 164: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,603 INFO L290 TraceCheckUtils]: 165: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,603 INFO L290 TraceCheckUtils]: 166: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,603 INFO L290 TraceCheckUtils]: 167: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,604 INFO L290 TraceCheckUtils]: 168: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,604 INFO L290 TraceCheckUtils]: 169: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,604 INFO L290 TraceCheckUtils]: 170: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,604 INFO L290 TraceCheckUtils]: 171: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,605 INFO L290 TraceCheckUtils]: 172: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,605 INFO L290 TraceCheckUtils]: 173: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,605 INFO L290 TraceCheckUtils]: 174: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,605 INFO L290 TraceCheckUtils]: 175: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,606 INFO L290 TraceCheckUtils]: 176: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,606 INFO L290 TraceCheckUtils]: 177: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,606 INFO L290 TraceCheckUtils]: 178: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,606 INFO L290 TraceCheckUtils]: 179: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,606 INFO L290 TraceCheckUtils]: 180: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,607 INFO L290 TraceCheckUtils]: 181: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,607 INFO L290 TraceCheckUtils]: 182: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,607 INFO L290 TraceCheckUtils]: 183: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,607 INFO L290 TraceCheckUtils]: 184: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,608 INFO L290 TraceCheckUtils]: 185: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,608 INFO L290 TraceCheckUtils]: 186: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,608 INFO L290 TraceCheckUtils]: 187: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,608 INFO L290 TraceCheckUtils]: 188: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,609 INFO L290 TraceCheckUtils]: 189: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,609 INFO L290 TraceCheckUtils]: 190: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,609 INFO L290 TraceCheckUtils]: 191: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,609 INFO L290 TraceCheckUtils]: 192: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,609 INFO L290 TraceCheckUtils]: 193: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,610 INFO L290 TraceCheckUtils]: 194: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,610 INFO L290 TraceCheckUtils]: 195: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,610 INFO L290 TraceCheckUtils]: 196: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,610 INFO L290 TraceCheckUtils]: 197: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,611 INFO L290 TraceCheckUtils]: 198: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,611 INFO L290 TraceCheckUtils]: 199: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,611 INFO L290 TraceCheckUtils]: 200: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,611 INFO L290 TraceCheckUtils]: 201: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,612 INFO L290 TraceCheckUtils]: 202: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,612 INFO L290 TraceCheckUtils]: 203: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,612 INFO L290 TraceCheckUtils]: 204: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,612 INFO L290 TraceCheckUtils]: 205: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,612 INFO L290 TraceCheckUtils]: 206: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,613 INFO L290 TraceCheckUtils]: 207: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,613 INFO L290 TraceCheckUtils]: 208: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,613 INFO L290 TraceCheckUtils]: 209: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,613 INFO L290 TraceCheckUtils]: 210: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,614 INFO L290 TraceCheckUtils]: 211: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,615 INFO L290 TraceCheckUtils]: 212: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,615 INFO L290 TraceCheckUtils]: 213: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,616 INFO L290 TraceCheckUtils]: 214: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,616 INFO L290 TraceCheckUtils]: 215: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,616 INFO L290 TraceCheckUtils]: 216: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,616 INFO L290 TraceCheckUtils]: 217: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,617 INFO L290 TraceCheckUtils]: 218: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,617 INFO L290 TraceCheckUtils]: 219: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,617 INFO L290 TraceCheckUtils]: 220: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,617 INFO L290 TraceCheckUtils]: 221: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,617 INFO L290 TraceCheckUtils]: 222: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,618 INFO L290 TraceCheckUtils]: 223: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,618 INFO L290 TraceCheckUtils]: 224: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,618 INFO L290 TraceCheckUtils]: 225: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,618 INFO L290 TraceCheckUtils]: 226: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,619 INFO L290 TraceCheckUtils]: 227: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,619 INFO L290 TraceCheckUtils]: 228: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,619 INFO L290 TraceCheckUtils]: 229: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,619 INFO L290 TraceCheckUtils]: 230: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,620 INFO L290 TraceCheckUtils]: 231: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,620 INFO L290 TraceCheckUtils]: 232: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,620 INFO L290 TraceCheckUtils]: 233: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,620 INFO L290 TraceCheckUtils]: 234: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,620 INFO L290 TraceCheckUtils]: 235: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,621 INFO L290 TraceCheckUtils]: 236: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,621 INFO L290 TraceCheckUtils]: 237: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,621 INFO L290 TraceCheckUtils]: 238: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,621 INFO L290 TraceCheckUtils]: 239: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,622 INFO L290 TraceCheckUtils]: 240: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,622 INFO L290 TraceCheckUtils]: 241: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,622 INFO L290 TraceCheckUtils]: 242: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,622 INFO L290 TraceCheckUtils]: 243: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,623 INFO L290 TraceCheckUtils]: 244: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,623 INFO L290 TraceCheckUtils]: 245: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,623 INFO L290 TraceCheckUtils]: 246: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,623 INFO L290 TraceCheckUtils]: 247: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,623 INFO L290 TraceCheckUtils]: 248: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,624 INFO L290 TraceCheckUtils]: 249: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,624 INFO L290 TraceCheckUtils]: 250: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,624 INFO L290 TraceCheckUtils]: 251: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,624 INFO L290 TraceCheckUtils]: 252: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,625 INFO L290 TraceCheckUtils]: 253: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,625 INFO L290 TraceCheckUtils]: 254: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,625 INFO L290 TraceCheckUtils]: 255: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,625 INFO L290 TraceCheckUtils]: 256: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,626 INFO L290 TraceCheckUtils]: 257: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,626 INFO L290 TraceCheckUtils]: 258: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,626 INFO L290 TraceCheckUtils]: 259: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,626 INFO L290 TraceCheckUtils]: 260: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,626 INFO L290 TraceCheckUtils]: 261: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,627 INFO L290 TraceCheckUtils]: 262: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,627 INFO L290 TraceCheckUtils]: 263: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,627 INFO L290 TraceCheckUtils]: 264: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,627 INFO L290 TraceCheckUtils]: 265: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,628 INFO L290 TraceCheckUtils]: 266: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,628 INFO L290 TraceCheckUtils]: 267: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,628 INFO L290 TraceCheckUtils]: 268: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,628 INFO L290 TraceCheckUtils]: 269: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,629 INFO L290 TraceCheckUtils]: 270: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,629 INFO L290 TraceCheckUtils]: 271: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,629 INFO L290 TraceCheckUtils]: 272: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,629 INFO L290 TraceCheckUtils]: 273: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,629 INFO L290 TraceCheckUtils]: 274: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,630 INFO L290 TraceCheckUtils]: 275: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,630 INFO L290 TraceCheckUtils]: 276: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,630 INFO L290 TraceCheckUtils]: 277: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,630 INFO L290 TraceCheckUtils]: 278: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,631 INFO L290 TraceCheckUtils]: 279: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,631 INFO L290 TraceCheckUtils]: 280: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,631 INFO L290 TraceCheckUtils]: 281: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,631 INFO L290 TraceCheckUtils]: 282: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,631 INFO L290 TraceCheckUtils]: 283: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,632 INFO L290 TraceCheckUtils]: 284: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,632 INFO L290 TraceCheckUtils]: 285: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,632 INFO L290 TraceCheckUtils]: 286: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,632 INFO L290 TraceCheckUtils]: 287: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,633 INFO L290 TraceCheckUtils]: 288: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,633 INFO L290 TraceCheckUtils]: 289: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,633 INFO L290 TraceCheckUtils]: 290: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,633 INFO L290 TraceCheckUtils]: 291: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,634 INFO L290 TraceCheckUtils]: 292: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,634 INFO L290 TraceCheckUtils]: 293: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,634 INFO L290 TraceCheckUtils]: 294: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,634 INFO L290 TraceCheckUtils]: 295: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,634 INFO L290 TraceCheckUtils]: 296: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,635 INFO L290 TraceCheckUtils]: 297: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,635 INFO L290 TraceCheckUtils]: 298: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,635 INFO L290 TraceCheckUtils]: 299: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,635 INFO L290 TraceCheckUtils]: 300: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,636 INFO L290 TraceCheckUtils]: 301: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,636 INFO L290 TraceCheckUtils]: 302: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,636 INFO L290 TraceCheckUtils]: 303: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,636 INFO L290 TraceCheckUtils]: 304: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,636 INFO L290 TraceCheckUtils]: 305: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,637 INFO L290 TraceCheckUtils]: 306: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,637 INFO L290 TraceCheckUtils]: 307: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,637 INFO L290 TraceCheckUtils]: 308: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,637 INFO L290 TraceCheckUtils]: 309: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,638 INFO L290 TraceCheckUtils]: 310: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,638 INFO L290 TraceCheckUtils]: 311: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,638 INFO L290 TraceCheckUtils]: 312: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,638 INFO L290 TraceCheckUtils]: 313: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,639 INFO L290 TraceCheckUtils]: 314: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,639 INFO L290 TraceCheckUtils]: 315: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,639 INFO L290 TraceCheckUtils]: 316: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,639 INFO L290 TraceCheckUtils]: 317: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,639 INFO L290 TraceCheckUtils]: 318: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,640 INFO L290 TraceCheckUtils]: 319: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,640 INFO L290 TraceCheckUtils]: 320: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,640 INFO L290 TraceCheckUtils]: 321: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,640 INFO L290 TraceCheckUtils]: 322: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,641 INFO L290 TraceCheckUtils]: 323: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,641 INFO L290 TraceCheckUtils]: 324: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,641 INFO L290 TraceCheckUtils]: 325: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,641 INFO L290 TraceCheckUtils]: 326: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,641 INFO L290 TraceCheckUtils]: 327: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,642 INFO L290 TraceCheckUtils]: 328: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,642 INFO L290 TraceCheckUtils]: 329: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,642 INFO L290 TraceCheckUtils]: 330: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,642 INFO L290 TraceCheckUtils]: 331: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,643 INFO L290 TraceCheckUtils]: 332: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,643 INFO L290 TraceCheckUtils]: 333: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,643 INFO L290 TraceCheckUtils]: 334: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,643 INFO L290 TraceCheckUtils]: 335: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,644 INFO L290 TraceCheckUtils]: 336: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,644 INFO L290 TraceCheckUtils]: 337: Hoare triple {35737#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,644 INFO L290 TraceCheckUtils]: 338: Hoare triple {35737#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {35737#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:26,644 INFO L290 TraceCheckUtils]: 339: Hoare triple {35737#(<= 20 main_~edgecount~0)} ~i~0 := 0; {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:26,645 INFO L290 TraceCheckUtils]: 340: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:26,645 INFO L290 TraceCheckUtils]: 341: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:26,645 INFO L290 TraceCheckUtils]: 342: Hoare triple {36740#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {36750#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:26,646 INFO L290 TraceCheckUtils]: 343: Hoare triple {36750#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-28 09:01:26,646 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-28 09:01:26,646 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-28 09:01:26,646 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-28 09:01:26,646 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-28 09:01:26,646 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-28 09:01:26,646 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-28 09:01:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:26,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:27,720 INFO L290 TraceCheckUtils]: 349: Hoare triple {35711#false} assume !false; {35711#false} is VALID [2022-04-28 09:01:27,720 INFO L290 TraceCheckUtils]: 348: Hoare triple {35711#false} assume 0 == ~cond; {35711#false} is VALID [2022-04-28 09:01:27,720 INFO L290 TraceCheckUtils]: 347: Hoare triple {35711#false} ~cond := #in~cond; {35711#false} is VALID [2022-04-28 09:01:27,720 INFO L272 TraceCheckUtils]: 346: Hoare triple {35711#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35711#false} is VALID [2022-04-28 09:01:27,720 INFO L290 TraceCheckUtils]: 345: Hoare triple {35711#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35711#false} is VALID [2022-04-28 09:01:27,720 INFO L290 TraceCheckUtils]: 344: Hoare triple {35711#false} ~i~0 := 0; {35711#false} is VALID [2022-04-28 09:01:27,720 INFO L290 TraceCheckUtils]: 343: Hoare triple {36790#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {35711#false} is VALID [2022-04-28 09:01:27,721 INFO L290 TraceCheckUtils]: 342: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {36790#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,721 INFO L290 TraceCheckUtils]: 341: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:27,721 INFO L290 TraceCheckUtils]: 340: Hoare triple {36794#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:27,722 INFO L290 TraceCheckUtils]: 339: Hoare triple {36804#(< 1 main_~edgecount~0)} ~i~0 := 0; {36794#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:27,722 INFO L290 TraceCheckUtils]: 338: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,722 INFO L290 TraceCheckUtils]: 337: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,722 INFO L290 TraceCheckUtils]: 336: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,722 INFO L290 TraceCheckUtils]: 335: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,723 INFO L290 TraceCheckUtils]: 334: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,723 INFO L290 TraceCheckUtils]: 333: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,723 INFO L290 TraceCheckUtils]: 332: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,723 INFO L290 TraceCheckUtils]: 331: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,724 INFO L290 TraceCheckUtils]: 330: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,724 INFO L290 TraceCheckUtils]: 329: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,724 INFO L290 TraceCheckUtils]: 328: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,724 INFO L290 TraceCheckUtils]: 327: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,725 INFO L290 TraceCheckUtils]: 326: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,725 INFO L290 TraceCheckUtils]: 325: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,725 INFO L290 TraceCheckUtils]: 324: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,725 INFO L290 TraceCheckUtils]: 323: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,725 INFO L290 TraceCheckUtils]: 322: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,726 INFO L290 TraceCheckUtils]: 321: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,726 INFO L290 TraceCheckUtils]: 320: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,726 INFO L290 TraceCheckUtils]: 319: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,726 INFO L290 TraceCheckUtils]: 318: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,727 INFO L290 TraceCheckUtils]: 317: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,727 INFO L290 TraceCheckUtils]: 316: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,727 INFO L290 TraceCheckUtils]: 315: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,727 INFO L290 TraceCheckUtils]: 314: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,728 INFO L290 TraceCheckUtils]: 313: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,728 INFO L290 TraceCheckUtils]: 312: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,728 INFO L290 TraceCheckUtils]: 311: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,728 INFO L290 TraceCheckUtils]: 310: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,729 INFO L290 TraceCheckUtils]: 309: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,729 INFO L290 TraceCheckUtils]: 308: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,729 INFO L290 TraceCheckUtils]: 307: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,729 INFO L290 TraceCheckUtils]: 306: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,730 INFO L290 TraceCheckUtils]: 305: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,730 INFO L290 TraceCheckUtils]: 304: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,730 INFO L290 TraceCheckUtils]: 303: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,730 INFO L290 TraceCheckUtils]: 302: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,730 INFO L290 TraceCheckUtils]: 301: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,731 INFO L290 TraceCheckUtils]: 300: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,731 INFO L290 TraceCheckUtils]: 299: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,731 INFO L290 TraceCheckUtils]: 298: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,731 INFO L290 TraceCheckUtils]: 297: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,732 INFO L290 TraceCheckUtils]: 296: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,732 INFO L290 TraceCheckUtils]: 295: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,732 INFO L290 TraceCheckUtils]: 294: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,732 INFO L290 TraceCheckUtils]: 293: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,733 INFO L290 TraceCheckUtils]: 292: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,733 INFO L290 TraceCheckUtils]: 291: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,733 INFO L290 TraceCheckUtils]: 290: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,733 INFO L290 TraceCheckUtils]: 289: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,734 INFO L290 TraceCheckUtils]: 288: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,734 INFO L290 TraceCheckUtils]: 287: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,734 INFO L290 TraceCheckUtils]: 286: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,734 INFO L290 TraceCheckUtils]: 285: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,735 INFO L290 TraceCheckUtils]: 284: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,735 INFO L290 TraceCheckUtils]: 283: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,735 INFO L290 TraceCheckUtils]: 282: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,735 INFO L290 TraceCheckUtils]: 281: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,736 INFO L290 TraceCheckUtils]: 280: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,736 INFO L290 TraceCheckUtils]: 279: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,736 INFO L290 TraceCheckUtils]: 278: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,736 INFO L290 TraceCheckUtils]: 277: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,736 INFO L290 TraceCheckUtils]: 276: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,737 INFO L290 TraceCheckUtils]: 275: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,737 INFO L290 TraceCheckUtils]: 274: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,737 INFO L290 TraceCheckUtils]: 273: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,737 INFO L290 TraceCheckUtils]: 272: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,738 INFO L290 TraceCheckUtils]: 271: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,738 INFO L290 TraceCheckUtils]: 270: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,738 INFO L290 TraceCheckUtils]: 269: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,738 INFO L290 TraceCheckUtils]: 268: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,738 INFO L290 TraceCheckUtils]: 267: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,739 INFO L290 TraceCheckUtils]: 266: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,739 INFO L290 TraceCheckUtils]: 265: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,739 INFO L290 TraceCheckUtils]: 264: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,739 INFO L290 TraceCheckUtils]: 263: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,740 INFO L290 TraceCheckUtils]: 262: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,740 INFO L290 TraceCheckUtils]: 261: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,740 INFO L290 TraceCheckUtils]: 260: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,740 INFO L290 TraceCheckUtils]: 259: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,741 INFO L290 TraceCheckUtils]: 258: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,741 INFO L290 TraceCheckUtils]: 257: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,741 INFO L290 TraceCheckUtils]: 256: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,741 INFO L290 TraceCheckUtils]: 255: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,741 INFO L290 TraceCheckUtils]: 254: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,742 INFO L290 TraceCheckUtils]: 253: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,742 INFO L290 TraceCheckUtils]: 252: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,742 INFO L290 TraceCheckUtils]: 251: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,742 INFO L290 TraceCheckUtils]: 250: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,743 INFO L290 TraceCheckUtils]: 249: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,743 INFO L290 TraceCheckUtils]: 248: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,743 INFO L290 TraceCheckUtils]: 247: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,743 INFO L290 TraceCheckUtils]: 246: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,744 INFO L290 TraceCheckUtils]: 245: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,744 INFO L290 TraceCheckUtils]: 244: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,744 INFO L290 TraceCheckUtils]: 243: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,744 INFO L290 TraceCheckUtils]: 242: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,744 INFO L290 TraceCheckUtils]: 241: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,745 INFO L290 TraceCheckUtils]: 240: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,745 INFO L290 TraceCheckUtils]: 239: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,745 INFO L290 TraceCheckUtils]: 238: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,745 INFO L290 TraceCheckUtils]: 237: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,746 INFO L290 TraceCheckUtils]: 236: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,746 INFO L290 TraceCheckUtils]: 235: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,746 INFO L290 TraceCheckUtils]: 234: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,746 INFO L290 TraceCheckUtils]: 233: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,747 INFO L290 TraceCheckUtils]: 232: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,747 INFO L290 TraceCheckUtils]: 231: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,747 INFO L290 TraceCheckUtils]: 230: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,747 INFO L290 TraceCheckUtils]: 229: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,747 INFO L290 TraceCheckUtils]: 228: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,748 INFO L290 TraceCheckUtils]: 227: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,748 INFO L290 TraceCheckUtils]: 226: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,748 INFO L290 TraceCheckUtils]: 225: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,748 INFO L290 TraceCheckUtils]: 224: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,749 INFO L290 TraceCheckUtils]: 223: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,749 INFO L290 TraceCheckUtils]: 222: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,749 INFO L290 TraceCheckUtils]: 221: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,749 INFO L290 TraceCheckUtils]: 220: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,749 INFO L290 TraceCheckUtils]: 219: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,750 INFO L290 TraceCheckUtils]: 218: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,750 INFO L290 TraceCheckUtils]: 217: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,750 INFO L290 TraceCheckUtils]: 216: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,750 INFO L290 TraceCheckUtils]: 215: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,751 INFO L290 TraceCheckUtils]: 214: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,751 INFO L290 TraceCheckUtils]: 213: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,751 INFO L290 TraceCheckUtils]: 212: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,751 INFO L290 TraceCheckUtils]: 211: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,752 INFO L290 TraceCheckUtils]: 210: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,752 INFO L290 TraceCheckUtils]: 209: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,752 INFO L290 TraceCheckUtils]: 208: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,752 INFO L290 TraceCheckUtils]: 207: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,752 INFO L290 TraceCheckUtils]: 206: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,753 INFO L290 TraceCheckUtils]: 205: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,753 INFO L290 TraceCheckUtils]: 204: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,753 INFO L290 TraceCheckUtils]: 203: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,753 INFO L290 TraceCheckUtils]: 202: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,754 INFO L290 TraceCheckUtils]: 201: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,754 INFO L290 TraceCheckUtils]: 200: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,754 INFO L290 TraceCheckUtils]: 199: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,754 INFO L290 TraceCheckUtils]: 198: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,755 INFO L290 TraceCheckUtils]: 197: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,755 INFO L290 TraceCheckUtils]: 196: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,755 INFO L290 TraceCheckUtils]: 195: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,755 INFO L290 TraceCheckUtils]: 194: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,756 INFO L290 TraceCheckUtils]: 193: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,756 INFO L290 TraceCheckUtils]: 192: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,756 INFO L290 TraceCheckUtils]: 191: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,756 INFO L290 TraceCheckUtils]: 190: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,756 INFO L290 TraceCheckUtils]: 189: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,757 INFO L290 TraceCheckUtils]: 188: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,757 INFO L290 TraceCheckUtils]: 187: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,757 INFO L290 TraceCheckUtils]: 186: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,757 INFO L290 TraceCheckUtils]: 185: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,758 INFO L290 TraceCheckUtils]: 184: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,758 INFO L290 TraceCheckUtils]: 183: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,758 INFO L290 TraceCheckUtils]: 182: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,758 INFO L290 TraceCheckUtils]: 181: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,759 INFO L290 TraceCheckUtils]: 180: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,759 INFO L290 TraceCheckUtils]: 179: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,759 INFO L290 TraceCheckUtils]: 178: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,759 INFO L290 TraceCheckUtils]: 177: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,759 INFO L290 TraceCheckUtils]: 176: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,760 INFO L290 TraceCheckUtils]: 175: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,760 INFO L290 TraceCheckUtils]: 174: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,760 INFO L290 TraceCheckUtils]: 173: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,760 INFO L290 TraceCheckUtils]: 172: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,761 INFO L290 TraceCheckUtils]: 171: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,761 INFO L290 TraceCheckUtils]: 170: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,761 INFO L290 TraceCheckUtils]: 169: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,761 INFO L290 TraceCheckUtils]: 168: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,762 INFO L290 TraceCheckUtils]: 167: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,762 INFO L290 TraceCheckUtils]: 166: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,762 INFO L290 TraceCheckUtils]: 165: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,762 INFO L290 TraceCheckUtils]: 164: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,762 INFO L290 TraceCheckUtils]: 163: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,763 INFO L290 TraceCheckUtils]: 162: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,763 INFO L290 TraceCheckUtils]: 161: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,763 INFO L290 TraceCheckUtils]: 160: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,763 INFO L290 TraceCheckUtils]: 159: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,764 INFO L290 TraceCheckUtils]: 158: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,764 INFO L290 TraceCheckUtils]: 157: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,764 INFO L290 TraceCheckUtils]: 156: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,764 INFO L290 TraceCheckUtils]: 155: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,765 INFO L290 TraceCheckUtils]: 154: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,765 INFO L290 TraceCheckUtils]: 153: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,765 INFO L290 TraceCheckUtils]: 152: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,765 INFO L290 TraceCheckUtils]: 151: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,765 INFO L290 TraceCheckUtils]: 150: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,766 INFO L290 TraceCheckUtils]: 149: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,766 INFO L290 TraceCheckUtils]: 148: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,766 INFO L290 TraceCheckUtils]: 147: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,766 INFO L290 TraceCheckUtils]: 146: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,767 INFO L290 TraceCheckUtils]: 145: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,767 INFO L290 TraceCheckUtils]: 144: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,767 INFO L290 TraceCheckUtils]: 143: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,767 INFO L290 TraceCheckUtils]: 142: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,767 INFO L290 TraceCheckUtils]: 141: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,768 INFO L290 TraceCheckUtils]: 140: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,768 INFO L290 TraceCheckUtils]: 139: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,768 INFO L290 TraceCheckUtils]: 138: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,768 INFO L290 TraceCheckUtils]: 137: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,769 INFO L290 TraceCheckUtils]: 136: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,769 INFO L290 TraceCheckUtils]: 135: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,769 INFO L290 TraceCheckUtils]: 134: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,769 INFO L290 TraceCheckUtils]: 133: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,770 INFO L290 TraceCheckUtils]: 132: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,770 INFO L290 TraceCheckUtils]: 131: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,770 INFO L290 TraceCheckUtils]: 130: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,770 INFO L290 TraceCheckUtils]: 129: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,770 INFO L290 TraceCheckUtils]: 128: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,771 INFO L290 TraceCheckUtils]: 127: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,771 INFO L290 TraceCheckUtils]: 126: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,771 INFO L290 TraceCheckUtils]: 125: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,771 INFO L290 TraceCheckUtils]: 124: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,772 INFO L290 TraceCheckUtils]: 123: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,772 INFO L290 TraceCheckUtils]: 122: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,772 INFO L290 TraceCheckUtils]: 121: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,772 INFO L290 TraceCheckUtils]: 120: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,773 INFO L290 TraceCheckUtils]: 119: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,773 INFO L290 TraceCheckUtils]: 118: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,773 INFO L290 TraceCheckUtils]: 117: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,773 INFO L290 TraceCheckUtils]: 116: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,773 INFO L290 TraceCheckUtils]: 115: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,774 INFO L290 TraceCheckUtils]: 114: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,774 INFO L290 TraceCheckUtils]: 113: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,774 INFO L290 TraceCheckUtils]: 112: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,774 INFO L290 TraceCheckUtils]: 111: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,775 INFO L290 TraceCheckUtils]: 110: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,775 INFO L290 TraceCheckUtils]: 109: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,775 INFO L290 TraceCheckUtils]: 108: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,775 INFO L290 TraceCheckUtils]: 107: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,776 INFO L290 TraceCheckUtils]: 106: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,776 INFO L290 TraceCheckUtils]: 105: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,776 INFO L290 TraceCheckUtils]: 104: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,776 INFO L290 TraceCheckUtils]: 103: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,776 INFO L290 TraceCheckUtils]: 102: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,777 INFO L290 TraceCheckUtils]: 101: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,777 INFO L290 TraceCheckUtils]: 100: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,777 INFO L290 TraceCheckUtils]: 99: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,777 INFO L290 TraceCheckUtils]: 98: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,778 INFO L290 TraceCheckUtils]: 96: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,778 INFO L290 TraceCheckUtils]: 95: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,778 INFO L290 TraceCheckUtils]: 94: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,778 INFO L290 TraceCheckUtils]: 93: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,779 INFO L290 TraceCheckUtils]: 92: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,779 INFO L290 TraceCheckUtils]: 91: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,779 INFO L290 TraceCheckUtils]: 90: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,779 INFO L290 TraceCheckUtils]: 89: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,780 INFO L290 TraceCheckUtils]: 88: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,780 INFO L290 TraceCheckUtils]: 87: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,781 INFO L290 TraceCheckUtils]: 84: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,781 INFO L290 TraceCheckUtils]: 83: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,781 INFO L290 TraceCheckUtils]: 82: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,781 INFO L290 TraceCheckUtils]: 81: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,781 INFO L290 TraceCheckUtils]: 80: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,783 INFO L290 TraceCheckUtils]: 74: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {36804#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {36804#(< 1 main_~edgecount~0)} ~i~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {36804#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {36804#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {36804#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {35710#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {36804#(< 1 main_~edgecount~0)} is VALID [2022-04-28 09:01:27,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {35710#true} call #t~ret22 := main(); {35710#true} is VALID [2022-04-28 09:01:27,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35710#true} {35710#true} #107#return; {35710#true} is VALID [2022-04-28 09:01:27,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {35710#true} assume true; {35710#true} is VALID [2022-04-28 09:01:27,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {35710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35710#true} is VALID [2022-04-28 09:01:27,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {35710#true} call ULTIMATE.init(); {35710#true} is VALID [2022-04-28 09:01:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:27,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742798953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:27,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:27,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-28 09:01:27,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:27,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [931911396] [2022-04-28 09:01:27,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [931911396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:27,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:27,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:01:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029958074] [2022-04-28 09:01:27,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:27,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2022-04-28 09:01:27,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:27,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:27,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:27,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:01:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:27,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:01:27,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:01:27,836 INFO L87 Difference]: Start difference. First operand 355 states and 464 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:29,374 INFO L93 Difference]: Finished difference Result 379 states and 491 transitions. [2022-04-28 09:01:29,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:01:29,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2022-04-28 09:01:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-28 09:01:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-04-28 09:01:29,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2022-04-28 09:01:29,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:29,458 INFO L225 Difference]: With dead ends: 379 [2022-04-28 09:01:29,458 INFO L226 Difference]: Without dead ends: 368 [2022-04-28 09:01:29,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:01:29,459 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 98 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:29,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 29 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-28 09:01:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 358. [2022-04-28 09:01:30,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:30,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:30,752 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:30,752 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:30,758 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-28 09:01:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-28 09:01:30,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:30,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:30,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 368 states. [2022-04-28 09:01:30,759 INFO L87 Difference]: Start difference. First operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 368 states. [2022-04-28 09:01:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:30,765 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2022-04-28 09:01:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 479 transitions. [2022-04-28 09:01:30,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:30,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:30,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:30,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 352 states have (on average 1.3125) internal successors, (462), 352 states have internal predecessors, (462), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 467 transitions. [2022-04-28 09:01:30,771 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 467 transitions. Word has length 350 [2022-04-28 09:01:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:30,772 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 467 transitions. [2022-04-28 09:01:30,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:30,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 358 states and 467 transitions. [2022-04-28 09:01:31,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 467 transitions. [2022-04-28 09:01:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-04-28 09:01:31,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:31,556 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:31,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:31,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:31,757 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 55 times [2022-04-28 09:01:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:31,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318644790] [2022-04-28 09:01:31,760 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:31,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423610, now seen corresponding path program 56 times [2022-04-28 09:01:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:31,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32946864] [2022-04-28 09:01:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:32,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-28 09:01:32,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-28 09:01:32,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-28 09:01:32,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:32,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {40049#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-28 09:01:32,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-28 09:01:32,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-28 09:01:32,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-28 09:01:32,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,057 INFO L290 TraceCheckUtils]: 70: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,057 INFO L290 TraceCheckUtils]: 71: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,057 INFO L290 TraceCheckUtils]: 72: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,057 INFO L290 TraceCheckUtils]: 73: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,058 INFO L290 TraceCheckUtils]: 75: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,059 INFO L290 TraceCheckUtils]: 80: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,059 INFO L290 TraceCheckUtils]: 81: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,059 INFO L290 TraceCheckUtils]: 82: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,059 INFO L290 TraceCheckUtils]: 83: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,059 INFO L290 TraceCheckUtils]: 84: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,060 INFO L290 TraceCheckUtils]: 85: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,060 INFO L290 TraceCheckUtils]: 86: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,060 INFO L290 TraceCheckUtils]: 87: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,060 INFO L290 TraceCheckUtils]: 88: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,060 INFO L290 TraceCheckUtils]: 89: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,061 INFO L290 TraceCheckUtils]: 90: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,061 INFO L290 TraceCheckUtils]: 91: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,061 INFO L290 TraceCheckUtils]: 92: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,061 INFO L290 TraceCheckUtils]: 93: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,061 INFO L290 TraceCheckUtils]: 94: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,062 INFO L290 TraceCheckUtils]: 95: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,062 INFO L290 TraceCheckUtils]: 96: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,062 INFO L290 TraceCheckUtils]: 97: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,062 INFO L290 TraceCheckUtils]: 98: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,062 INFO L290 TraceCheckUtils]: 99: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,063 INFO L290 TraceCheckUtils]: 100: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,063 INFO L290 TraceCheckUtils]: 101: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,063 INFO L290 TraceCheckUtils]: 102: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,063 INFO L290 TraceCheckUtils]: 103: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,064 INFO L290 TraceCheckUtils]: 104: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,064 INFO L290 TraceCheckUtils]: 105: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,064 INFO L290 TraceCheckUtils]: 106: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,064 INFO L290 TraceCheckUtils]: 107: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,064 INFO L290 TraceCheckUtils]: 108: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,065 INFO L290 TraceCheckUtils]: 109: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,065 INFO L290 TraceCheckUtils]: 110: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,065 INFO L290 TraceCheckUtils]: 111: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,065 INFO L290 TraceCheckUtils]: 112: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,065 INFO L290 TraceCheckUtils]: 113: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,066 INFO L290 TraceCheckUtils]: 114: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,066 INFO L290 TraceCheckUtils]: 115: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,066 INFO L290 TraceCheckUtils]: 116: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,066 INFO L290 TraceCheckUtils]: 117: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,066 INFO L290 TraceCheckUtils]: 118: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,067 INFO L290 TraceCheckUtils]: 119: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,067 INFO L290 TraceCheckUtils]: 120: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,067 INFO L290 TraceCheckUtils]: 121: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,067 INFO L290 TraceCheckUtils]: 122: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,068 INFO L290 TraceCheckUtils]: 123: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,068 INFO L290 TraceCheckUtils]: 124: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,068 INFO L290 TraceCheckUtils]: 125: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,068 INFO L290 TraceCheckUtils]: 126: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,068 INFO L290 TraceCheckUtils]: 127: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,069 INFO L290 TraceCheckUtils]: 128: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,069 INFO L290 TraceCheckUtils]: 129: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,069 INFO L290 TraceCheckUtils]: 130: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,069 INFO L290 TraceCheckUtils]: 131: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,069 INFO L290 TraceCheckUtils]: 132: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,070 INFO L290 TraceCheckUtils]: 133: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,070 INFO L290 TraceCheckUtils]: 134: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,070 INFO L290 TraceCheckUtils]: 135: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,070 INFO L290 TraceCheckUtils]: 136: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,070 INFO L290 TraceCheckUtils]: 137: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,071 INFO L290 TraceCheckUtils]: 138: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,071 INFO L290 TraceCheckUtils]: 139: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,071 INFO L290 TraceCheckUtils]: 140: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,071 INFO L290 TraceCheckUtils]: 141: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,071 INFO L290 TraceCheckUtils]: 142: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,072 INFO L290 TraceCheckUtils]: 143: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,072 INFO L290 TraceCheckUtils]: 144: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,072 INFO L290 TraceCheckUtils]: 145: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,072 INFO L290 TraceCheckUtils]: 146: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,072 INFO L290 TraceCheckUtils]: 147: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,073 INFO L290 TraceCheckUtils]: 148: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,073 INFO L290 TraceCheckUtils]: 149: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,073 INFO L290 TraceCheckUtils]: 150: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,073 INFO L290 TraceCheckUtils]: 151: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,074 INFO L290 TraceCheckUtils]: 152: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,074 INFO L290 TraceCheckUtils]: 153: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,074 INFO L290 TraceCheckUtils]: 154: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,074 INFO L290 TraceCheckUtils]: 155: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,074 INFO L290 TraceCheckUtils]: 156: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,075 INFO L290 TraceCheckUtils]: 157: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,075 INFO L290 TraceCheckUtils]: 158: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,075 INFO L290 TraceCheckUtils]: 159: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,075 INFO L290 TraceCheckUtils]: 160: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,075 INFO L290 TraceCheckUtils]: 161: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,076 INFO L290 TraceCheckUtils]: 162: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,076 INFO L290 TraceCheckUtils]: 163: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,076 INFO L290 TraceCheckUtils]: 164: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,076 INFO L290 TraceCheckUtils]: 165: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,076 INFO L290 TraceCheckUtils]: 166: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,077 INFO L290 TraceCheckUtils]: 167: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,077 INFO L290 TraceCheckUtils]: 168: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,077 INFO L290 TraceCheckUtils]: 169: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,077 INFO L290 TraceCheckUtils]: 170: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,077 INFO L290 TraceCheckUtils]: 171: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,078 INFO L290 TraceCheckUtils]: 172: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,078 INFO L290 TraceCheckUtils]: 173: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,078 INFO L290 TraceCheckUtils]: 174: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,078 INFO L290 TraceCheckUtils]: 175: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,078 INFO L290 TraceCheckUtils]: 176: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,079 INFO L290 TraceCheckUtils]: 177: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,079 INFO L290 TraceCheckUtils]: 178: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,079 INFO L290 TraceCheckUtils]: 179: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,079 INFO L290 TraceCheckUtils]: 180: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,079 INFO L290 TraceCheckUtils]: 181: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,080 INFO L290 TraceCheckUtils]: 182: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,080 INFO L290 TraceCheckUtils]: 183: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,080 INFO L290 TraceCheckUtils]: 184: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,080 INFO L290 TraceCheckUtils]: 185: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,081 INFO L290 TraceCheckUtils]: 186: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,081 INFO L290 TraceCheckUtils]: 187: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,081 INFO L290 TraceCheckUtils]: 188: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,081 INFO L290 TraceCheckUtils]: 189: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,081 INFO L290 TraceCheckUtils]: 190: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,082 INFO L290 TraceCheckUtils]: 191: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,082 INFO L290 TraceCheckUtils]: 192: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,082 INFO L290 TraceCheckUtils]: 193: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,082 INFO L290 TraceCheckUtils]: 194: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,082 INFO L290 TraceCheckUtils]: 195: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,083 INFO L290 TraceCheckUtils]: 196: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,083 INFO L290 TraceCheckUtils]: 197: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,083 INFO L290 TraceCheckUtils]: 198: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,083 INFO L290 TraceCheckUtils]: 199: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,083 INFO L290 TraceCheckUtils]: 200: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,084 INFO L290 TraceCheckUtils]: 201: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,084 INFO L290 TraceCheckUtils]: 202: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,084 INFO L290 TraceCheckUtils]: 203: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,084 INFO L290 TraceCheckUtils]: 204: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,084 INFO L290 TraceCheckUtils]: 205: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,085 INFO L290 TraceCheckUtils]: 206: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,085 INFO L290 TraceCheckUtils]: 207: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,085 INFO L290 TraceCheckUtils]: 208: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,085 INFO L290 TraceCheckUtils]: 209: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,085 INFO L290 TraceCheckUtils]: 210: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,086 INFO L290 TraceCheckUtils]: 211: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,086 INFO L290 TraceCheckUtils]: 212: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,086 INFO L290 TraceCheckUtils]: 213: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,086 INFO L290 TraceCheckUtils]: 214: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,086 INFO L290 TraceCheckUtils]: 215: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,087 INFO L290 TraceCheckUtils]: 216: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,087 INFO L290 TraceCheckUtils]: 217: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,087 INFO L290 TraceCheckUtils]: 218: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,087 INFO L290 TraceCheckUtils]: 219: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,087 INFO L290 TraceCheckUtils]: 220: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,088 INFO L290 TraceCheckUtils]: 221: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,088 INFO L290 TraceCheckUtils]: 222: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,088 INFO L290 TraceCheckUtils]: 223: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,088 INFO L290 TraceCheckUtils]: 224: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,088 INFO L290 TraceCheckUtils]: 225: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,089 INFO L290 TraceCheckUtils]: 226: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,089 INFO L290 TraceCheckUtils]: 227: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,089 INFO L290 TraceCheckUtils]: 228: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,089 INFO L290 TraceCheckUtils]: 229: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,089 INFO L290 TraceCheckUtils]: 230: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,090 INFO L290 TraceCheckUtils]: 231: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,090 INFO L290 TraceCheckUtils]: 232: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,090 INFO L290 TraceCheckUtils]: 233: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,090 INFO L290 TraceCheckUtils]: 234: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,090 INFO L290 TraceCheckUtils]: 235: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,091 INFO L290 TraceCheckUtils]: 236: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,091 INFO L290 TraceCheckUtils]: 237: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,091 INFO L290 TraceCheckUtils]: 238: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,091 INFO L290 TraceCheckUtils]: 239: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,092 INFO L290 TraceCheckUtils]: 240: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,092 INFO L290 TraceCheckUtils]: 241: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,092 INFO L290 TraceCheckUtils]: 242: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,092 INFO L290 TraceCheckUtils]: 243: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,092 INFO L290 TraceCheckUtils]: 244: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,093 INFO L290 TraceCheckUtils]: 245: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,093 INFO L290 TraceCheckUtils]: 246: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,093 INFO L290 TraceCheckUtils]: 247: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,093 INFO L290 TraceCheckUtils]: 248: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,093 INFO L290 TraceCheckUtils]: 249: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,094 INFO L290 TraceCheckUtils]: 250: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,094 INFO L290 TraceCheckUtils]: 251: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,094 INFO L290 TraceCheckUtils]: 252: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,094 INFO L290 TraceCheckUtils]: 253: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,094 INFO L290 TraceCheckUtils]: 254: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,095 INFO L290 TraceCheckUtils]: 255: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,095 INFO L290 TraceCheckUtils]: 256: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,095 INFO L290 TraceCheckUtils]: 257: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,095 INFO L290 TraceCheckUtils]: 258: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,095 INFO L290 TraceCheckUtils]: 259: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,096 INFO L290 TraceCheckUtils]: 260: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,096 INFO L290 TraceCheckUtils]: 261: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,096 INFO L290 TraceCheckUtils]: 262: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,096 INFO L290 TraceCheckUtils]: 263: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,096 INFO L290 TraceCheckUtils]: 264: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,097 INFO L290 TraceCheckUtils]: 265: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,097 INFO L290 TraceCheckUtils]: 266: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,097 INFO L290 TraceCheckUtils]: 267: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,097 INFO L290 TraceCheckUtils]: 268: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,097 INFO L290 TraceCheckUtils]: 269: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,098 INFO L290 TraceCheckUtils]: 270: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,098 INFO L290 TraceCheckUtils]: 271: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,098 INFO L290 TraceCheckUtils]: 272: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,098 INFO L290 TraceCheckUtils]: 273: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,098 INFO L290 TraceCheckUtils]: 274: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,099 INFO L290 TraceCheckUtils]: 275: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,099 INFO L290 TraceCheckUtils]: 276: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,099 INFO L290 TraceCheckUtils]: 277: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,099 INFO L290 TraceCheckUtils]: 278: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,100 INFO L290 TraceCheckUtils]: 279: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,100 INFO L290 TraceCheckUtils]: 280: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,100 INFO L290 TraceCheckUtils]: 281: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,100 INFO L290 TraceCheckUtils]: 282: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,100 INFO L290 TraceCheckUtils]: 283: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,101 INFO L290 TraceCheckUtils]: 284: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,101 INFO L290 TraceCheckUtils]: 285: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,101 INFO L290 TraceCheckUtils]: 286: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,101 INFO L290 TraceCheckUtils]: 287: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,101 INFO L290 TraceCheckUtils]: 288: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,102 INFO L290 TraceCheckUtils]: 289: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,102 INFO L290 TraceCheckUtils]: 290: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,102 INFO L290 TraceCheckUtils]: 291: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,102 INFO L290 TraceCheckUtils]: 292: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,102 INFO L290 TraceCheckUtils]: 293: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,103 INFO L290 TraceCheckUtils]: 294: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,103 INFO L290 TraceCheckUtils]: 295: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,103 INFO L290 TraceCheckUtils]: 296: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,103 INFO L290 TraceCheckUtils]: 297: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,103 INFO L290 TraceCheckUtils]: 298: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,104 INFO L290 TraceCheckUtils]: 299: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,104 INFO L290 TraceCheckUtils]: 300: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,104 INFO L290 TraceCheckUtils]: 301: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,104 INFO L290 TraceCheckUtils]: 302: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,104 INFO L290 TraceCheckUtils]: 303: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,105 INFO L290 TraceCheckUtils]: 304: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,105 INFO L290 TraceCheckUtils]: 305: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,105 INFO L290 TraceCheckUtils]: 306: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,105 INFO L290 TraceCheckUtils]: 307: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,105 INFO L290 TraceCheckUtils]: 308: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,106 INFO L290 TraceCheckUtils]: 309: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,106 INFO L290 TraceCheckUtils]: 310: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,106 INFO L290 TraceCheckUtils]: 311: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,106 INFO L290 TraceCheckUtils]: 312: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,107 INFO L290 TraceCheckUtils]: 313: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,107 INFO L290 TraceCheckUtils]: 314: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,107 INFO L290 TraceCheckUtils]: 315: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,107 INFO L290 TraceCheckUtils]: 316: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,107 INFO L290 TraceCheckUtils]: 317: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,108 INFO L290 TraceCheckUtils]: 318: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,108 INFO L290 TraceCheckUtils]: 319: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,108 INFO L290 TraceCheckUtils]: 320: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,108 INFO L290 TraceCheckUtils]: 321: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,108 INFO L290 TraceCheckUtils]: 322: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,109 INFO L290 TraceCheckUtils]: 323: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,109 INFO L290 TraceCheckUtils]: 324: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,109 INFO L290 TraceCheckUtils]: 325: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,109 INFO L290 TraceCheckUtils]: 326: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,109 INFO L290 TraceCheckUtils]: 327: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,110 INFO L290 TraceCheckUtils]: 328: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,110 INFO L290 TraceCheckUtils]: 329: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,110 INFO L290 TraceCheckUtils]: 330: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,110 INFO L290 TraceCheckUtils]: 331: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,110 INFO L290 TraceCheckUtils]: 332: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,111 INFO L290 TraceCheckUtils]: 333: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,111 INFO L290 TraceCheckUtils]: 334: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,111 INFO L290 TraceCheckUtils]: 335: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,111 INFO L290 TraceCheckUtils]: 336: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,111 INFO L290 TraceCheckUtils]: 337: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,112 INFO L290 TraceCheckUtils]: 338: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:32,112 INFO L290 TraceCheckUtils]: 339: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:32,112 INFO L290 TraceCheckUtils]: 340: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:32,113 INFO L290 TraceCheckUtils]: 341: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:32,113 INFO L290 TraceCheckUtils]: 342: Hoare triple {40046#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:32,113 INFO L290 TraceCheckUtils]: 343: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:32,114 INFO L290 TraceCheckUtils]: 344: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:32,114 INFO L290 TraceCheckUtils]: 345: Hoare triple {40047#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40048#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:32,114 INFO L290 TraceCheckUtils]: 346: Hoare triple {40048#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-28 09:01:32,114 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-28 09:01:32,114 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-28 09:01:32,114 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-28 09:01:32,114 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-28 09:01:32,115 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-28 09:01:32,115 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-28 09:01:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:32,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:32,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32946864] [2022-04-28 09:01:32,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32946864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:32,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122786298] [2022-04-28 09:01:32,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:32,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:32,117 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:32,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 09:01:32,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:32,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:32,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 2151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:01:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:32,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:33,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-28 09:01:33,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-28 09:01:33,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-28 09:01:33,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-28 09:01:33,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-28 09:01:33,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,759 INFO L290 TraceCheckUtils]: 54: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,761 INFO L290 TraceCheckUtils]: 59: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,761 INFO L290 TraceCheckUtils]: 60: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,762 INFO L290 TraceCheckUtils]: 66: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,764 INFO L290 TraceCheckUtils]: 72: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,764 INFO L290 TraceCheckUtils]: 73: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,764 INFO L290 TraceCheckUtils]: 74: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,764 INFO L290 TraceCheckUtils]: 75: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,765 INFO L290 TraceCheckUtils]: 79: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,766 INFO L290 TraceCheckUtils]: 80: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,766 INFO L290 TraceCheckUtils]: 81: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,766 INFO L290 TraceCheckUtils]: 82: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,766 INFO L290 TraceCheckUtils]: 83: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,766 INFO L290 TraceCheckUtils]: 84: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,767 INFO L290 TraceCheckUtils]: 85: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,767 INFO L290 TraceCheckUtils]: 86: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,767 INFO L290 TraceCheckUtils]: 87: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,767 INFO L290 TraceCheckUtils]: 88: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,768 INFO L290 TraceCheckUtils]: 90: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,768 INFO L290 TraceCheckUtils]: 91: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,768 INFO L290 TraceCheckUtils]: 92: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,769 INFO L290 TraceCheckUtils]: 93: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,769 INFO L290 TraceCheckUtils]: 94: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,769 INFO L290 TraceCheckUtils]: 95: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,769 INFO L290 TraceCheckUtils]: 96: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,770 INFO L290 TraceCheckUtils]: 97: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,770 INFO L290 TraceCheckUtils]: 98: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,770 INFO L290 TraceCheckUtils]: 99: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,770 INFO L290 TraceCheckUtils]: 100: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,770 INFO L290 TraceCheckUtils]: 101: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,771 INFO L290 TraceCheckUtils]: 102: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,771 INFO L290 TraceCheckUtils]: 103: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,771 INFO L290 TraceCheckUtils]: 104: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,771 INFO L290 TraceCheckUtils]: 105: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,772 INFO L290 TraceCheckUtils]: 106: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,772 INFO L290 TraceCheckUtils]: 107: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,772 INFO L290 TraceCheckUtils]: 108: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,772 INFO L290 TraceCheckUtils]: 109: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,773 INFO L290 TraceCheckUtils]: 110: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,773 INFO L290 TraceCheckUtils]: 111: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,773 INFO L290 TraceCheckUtils]: 112: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,773 INFO L290 TraceCheckUtils]: 113: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,774 INFO L290 TraceCheckUtils]: 114: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,774 INFO L290 TraceCheckUtils]: 115: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,774 INFO L290 TraceCheckUtils]: 117: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,774 INFO L290 TraceCheckUtils]: 118: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,775 INFO L290 TraceCheckUtils]: 119: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,775 INFO L290 TraceCheckUtils]: 120: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,775 INFO L290 TraceCheckUtils]: 121: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,775 INFO L290 TraceCheckUtils]: 122: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,776 INFO L290 TraceCheckUtils]: 123: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,776 INFO L290 TraceCheckUtils]: 124: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,776 INFO L290 TraceCheckUtils]: 125: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,776 INFO L290 TraceCheckUtils]: 126: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,777 INFO L290 TraceCheckUtils]: 127: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,777 INFO L290 TraceCheckUtils]: 128: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,777 INFO L290 TraceCheckUtils]: 129: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,777 INFO L290 TraceCheckUtils]: 130: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,778 INFO L290 TraceCheckUtils]: 131: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,778 INFO L290 TraceCheckUtils]: 132: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,778 INFO L290 TraceCheckUtils]: 133: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,778 INFO L290 TraceCheckUtils]: 134: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,779 INFO L290 TraceCheckUtils]: 135: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,779 INFO L290 TraceCheckUtils]: 136: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,779 INFO L290 TraceCheckUtils]: 137: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,779 INFO L290 TraceCheckUtils]: 138: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,779 INFO L290 TraceCheckUtils]: 139: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,780 INFO L290 TraceCheckUtils]: 140: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,780 INFO L290 TraceCheckUtils]: 141: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,780 INFO L290 TraceCheckUtils]: 142: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,780 INFO L290 TraceCheckUtils]: 143: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,781 INFO L290 TraceCheckUtils]: 144: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,781 INFO L290 TraceCheckUtils]: 145: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,781 INFO L290 TraceCheckUtils]: 146: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,781 INFO L290 TraceCheckUtils]: 147: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,782 INFO L290 TraceCheckUtils]: 148: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,782 INFO L290 TraceCheckUtils]: 149: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,782 INFO L290 TraceCheckUtils]: 150: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,782 INFO L290 TraceCheckUtils]: 151: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,783 INFO L290 TraceCheckUtils]: 152: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,783 INFO L290 TraceCheckUtils]: 153: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,783 INFO L290 TraceCheckUtils]: 154: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,783 INFO L290 TraceCheckUtils]: 155: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,783 INFO L290 TraceCheckUtils]: 156: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,784 INFO L290 TraceCheckUtils]: 157: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,784 INFO L290 TraceCheckUtils]: 158: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,784 INFO L290 TraceCheckUtils]: 159: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,784 INFO L290 TraceCheckUtils]: 160: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,785 INFO L290 TraceCheckUtils]: 161: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,785 INFO L290 TraceCheckUtils]: 162: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,785 INFO L290 TraceCheckUtils]: 163: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,785 INFO L290 TraceCheckUtils]: 164: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,786 INFO L290 TraceCheckUtils]: 165: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,786 INFO L290 TraceCheckUtils]: 166: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,786 INFO L290 TraceCheckUtils]: 167: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,786 INFO L290 TraceCheckUtils]: 168: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,787 INFO L290 TraceCheckUtils]: 169: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,787 INFO L290 TraceCheckUtils]: 170: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,787 INFO L290 TraceCheckUtils]: 171: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,787 INFO L290 TraceCheckUtils]: 172: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,788 INFO L290 TraceCheckUtils]: 173: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,788 INFO L290 TraceCheckUtils]: 174: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,788 INFO L290 TraceCheckUtils]: 175: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,788 INFO L290 TraceCheckUtils]: 176: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,788 INFO L290 TraceCheckUtils]: 177: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,789 INFO L290 TraceCheckUtils]: 178: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,789 INFO L290 TraceCheckUtils]: 179: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,789 INFO L290 TraceCheckUtils]: 180: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,789 INFO L290 TraceCheckUtils]: 181: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,790 INFO L290 TraceCheckUtils]: 182: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,790 INFO L290 TraceCheckUtils]: 183: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,790 INFO L290 TraceCheckUtils]: 184: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,790 INFO L290 TraceCheckUtils]: 185: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,791 INFO L290 TraceCheckUtils]: 186: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,791 INFO L290 TraceCheckUtils]: 187: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,791 INFO L290 TraceCheckUtils]: 188: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,791 INFO L290 TraceCheckUtils]: 189: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,792 INFO L290 TraceCheckUtils]: 190: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,792 INFO L290 TraceCheckUtils]: 191: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,792 INFO L290 TraceCheckUtils]: 192: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,792 INFO L290 TraceCheckUtils]: 193: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,792 INFO L290 TraceCheckUtils]: 194: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,793 INFO L290 TraceCheckUtils]: 195: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,793 INFO L290 TraceCheckUtils]: 196: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,793 INFO L290 TraceCheckUtils]: 197: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,793 INFO L290 TraceCheckUtils]: 198: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,794 INFO L290 TraceCheckUtils]: 199: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,794 INFO L290 TraceCheckUtils]: 200: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,794 INFO L290 TraceCheckUtils]: 201: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,794 INFO L290 TraceCheckUtils]: 202: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,795 INFO L290 TraceCheckUtils]: 203: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,795 INFO L290 TraceCheckUtils]: 204: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,795 INFO L290 TraceCheckUtils]: 205: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,795 INFO L290 TraceCheckUtils]: 206: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,796 INFO L290 TraceCheckUtils]: 207: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,796 INFO L290 TraceCheckUtils]: 208: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,796 INFO L290 TraceCheckUtils]: 209: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,796 INFO L290 TraceCheckUtils]: 210: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,796 INFO L290 TraceCheckUtils]: 211: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,797 INFO L290 TraceCheckUtils]: 212: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,797 INFO L290 TraceCheckUtils]: 213: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,797 INFO L290 TraceCheckUtils]: 214: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,797 INFO L290 TraceCheckUtils]: 215: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,798 INFO L290 TraceCheckUtils]: 216: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,798 INFO L290 TraceCheckUtils]: 217: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,798 INFO L290 TraceCheckUtils]: 218: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,798 INFO L290 TraceCheckUtils]: 219: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,799 INFO L290 TraceCheckUtils]: 220: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,799 INFO L290 TraceCheckUtils]: 221: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,799 INFO L290 TraceCheckUtils]: 222: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,799 INFO L290 TraceCheckUtils]: 223: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,800 INFO L290 TraceCheckUtils]: 224: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,800 INFO L290 TraceCheckUtils]: 225: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,800 INFO L290 TraceCheckUtils]: 226: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,800 INFO L290 TraceCheckUtils]: 227: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,801 INFO L290 TraceCheckUtils]: 228: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,801 INFO L290 TraceCheckUtils]: 229: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,801 INFO L290 TraceCheckUtils]: 230: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,801 INFO L290 TraceCheckUtils]: 231: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,802 INFO L290 TraceCheckUtils]: 232: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,802 INFO L290 TraceCheckUtils]: 233: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,802 INFO L290 TraceCheckUtils]: 234: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,802 INFO L290 TraceCheckUtils]: 235: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,802 INFO L290 TraceCheckUtils]: 236: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,803 INFO L290 TraceCheckUtils]: 237: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,803 INFO L290 TraceCheckUtils]: 238: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,803 INFO L290 TraceCheckUtils]: 239: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,803 INFO L290 TraceCheckUtils]: 240: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,804 INFO L290 TraceCheckUtils]: 241: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,804 INFO L290 TraceCheckUtils]: 242: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,804 INFO L290 TraceCheckUtils]: 243: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,804 INFO L290 TraceCheckUtils]: 244: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,805 INFO L290 TraceCheckUtils]: 245: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,805 INFO L290 TraceCheckUtils]: 246: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,805 INFO L290 TraceCheckUtils]: 247: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,805 INFO L290 TraceCheckUtils]: 248: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,806 INFO L290 TraceCheckUtils]: 249: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,806 INFO L290 TraceCheckUtils]: 250: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,806 INFO L290 TraceCheckUtils]: 251: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,806 INFO L290 TraceCheckUtils]: 252: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,806 INFO L290 TraceCheckUtils]: 253: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,807 INFO L290 TraceCheckUtils]: 254: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,807 INFO L290 TraceCheckUtils]: 255: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,807 INFO L290 TraceCheckUtils]: 256: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,807 INFO L290 TraceCheckUtils]: 257: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,808 INFO L290 TraceCheckUtils]: 258: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,808 INFO L290 TraceCheckUtils]: 259: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,808 INFO L290 TraceCheckUtils]: 260: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,808 INFO L290 TraceCheckUtils]: 261: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,809 INFO L290 TraceCheckUtils]: 262: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,809 INFO L290 TraceCheckUtils]: 263: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,809 INFO L290 TraceCheckUtils]: 264: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,809 INFO L290 TraceCheckUtils]: 265: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,810 INFO L290 TraceCheckUtils]: 266: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,810 INFO L290 TraceCheckUtils]: 267: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,810 INFO L290 TraceCheckUtils]: 268: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,810 INFO L290 TraceCheckUtils]: 269: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,810 INFO L290 TraceCheckUtils]: 270: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,811 INFO L290 TraceCheckUtils]: 271: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,811 INFO L290 TraceCheckUtils]: 272: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,811 INFO L290 TraceCheckUtils]: 273: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,811 INFO L290 TraceCheckUtils]: 274: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,812 INFO L290 TraceCheckUtils]: 275: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,812 INFO L290 TraceCheckUtils]: 276: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,812 INFO L290 TraceCheckUtils]: 277: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,812 INFO L290 TraceCheckUtils]: 278: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,813 INFO L290 TraceCheckUtils]: 279: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,813 INFO L290 TraceCheckUtils]: 280: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,813 INFO L290 TraceCheckUtils]: 281: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,813 INFO L290 TraceCheckUtils]: 282: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,814 INFO L290 TraceCheckUtils]: 283: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,814 INFO L290 TraceCheckUtils]: 284: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,814 INFO L290 TraceCheckUtils]: 285: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,814 INFO L290 TraceCheckUtils]: 286: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,814 INFO L290 TraceCheckUtils]: 287: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,815 INFO L290 TraceCheckUtils]: 288: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,815 INFO L290 TraceCheckUtils]: 289: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,815 INFO L290 TraceCheckUtils]: 290: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,815 INFO L290 TraceCheckUtils]: 291: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,816 INFO L290 TraceCheckUtils]: 292: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,816 INFO L290 TraceCheckUtils]: 293: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,816 INFO L290 TraceCheckUtils]: 294: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,816 INFO L290 TraceCheckUtils]: 295: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,817 INFO L290 TraceCheckUtils]: 296: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,817 INFO L290 TraceCheckUtils]: 297: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,817 INFO L290 TraceCheckUtils]: 298: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,817 INFO L290 TraceCheckUtils]: 299: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,818 INFO L290 TraceCheckUtils]: 300: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,818 INFO L290 TraceCheckUtils]: 301: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,818 INFO L290 TraceCheckUtils]: 302: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,819 INFO L290 TraceCheckUtils]: 303: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,819 INFO L290 TraceCheckUtils]: 304: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,819 INFO L290 TraceCheckUtils]: 305: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,819 INFO L290 TraceCheckUtils]: 306: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,820 INFO L290 TraceCheckUtils]: 307: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,820 INFO L290 TraceCheckUtils]: 308: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,820 INFO L290 TraceCheckUtils]: 309: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,820 INFO L290 TraceCheckUtils]: 310: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,820 INFO L290 TraceCheckUtils]: 311: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,821 INFO L290 TraceCheckUtils]: 312: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,821 INFO L290 TraceCheckUtils]: 313: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,821 INFO L290 TraceCheckUtils]: 314: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,821 INFO L290 TraceCheckUtils]: 315: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,822 INFO L290 TraceCheckUtils]: 316: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,822 INFO L290 TraceCheckUtils]: 317: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,822 INFO L290 TraceCheckUtils]: 318: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,822 INFO L290 TraceCheckUtils]: 319: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,823 INFO L290 TraceCheckUtils]: 320: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,823 INFO L290 TraceCheckUtils]: 321: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,823 INFO L290 TraceCheckUtils]: 322: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,823 INFO L290 TraceCheckUtils]: 323: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,824 INFO L290 TraceCheckUtils]: 324: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,824 INFO L290 TraceCheckUtils]: 325: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,824 INFO L290 TraceCheckUtils]: 326: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,824 INFO L290 TraceCheckUtils]: 327: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,825 INFO L290 TraceCheckUtils]: 328: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,825 INFO L290 TraceCheckUtils]: 329: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,825 INFO L290 TraceCheckUtils]: 330: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,825 INFO L290 TraceCheckUtils]: 331: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,825 INFO L290 TraceCheckUtils]: 332: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,826 INFO L290 TraceCheckUtils]: 333: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,826 INFO L290 TraceCheckUtils]: 334: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,826 INFO L290 TraceCheckUtils]: 335: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,826 INFO L290 TraceCheckUtils]: 336: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,827 INFO L290 TraceCheckUtils]: 337: Hoare triple {40045#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,827 INFO L290 TraceCheckUtils]: 338: Hoare triple {40045#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {40045#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:33,827 INFO L290 TraceCheckUtils]: 339: Hoare triple {40045#(<= 20 main_~edgecount~0)} ~i~0 := 0; {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:33,828 INFO L290 TraceCheckUtils]: 340: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:33,828 INFO L290 TraceCheckUtils]: 341: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:33,828 INFO L290 TraceCheckUtils]: 342: Hoare triple {41070#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:33,829 INFO L290 TraceCheckUtils]: 343: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:33,829 INFO L290 TraceCheckUtils]: 344: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:33,830 INFO L290 TraceCheckUtils]: 345: Hoare triple {41080#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41090#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:33,830 INFO L290 TraceCheckUtils]: 346: Hoare triple {41090#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-28 09:01:33,830 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-28 09:01:33,830 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-28 09:01:33,830 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-28 09:01:33,830 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-28 09:01:33,830 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-28 09:01:33,830 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-28 09:01:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:33,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:34,878 INFO L290 TraceCheckUtils]: 352: Hoare triple {40041#false} assume !false; {40041#false} is VALID [2022-04-28 09:01:34,879 INFO L290 TraceCheckUtils]: 351: Hoare triple {40041#false} assume 0 == ~cond; {40041#false} is VALID [2022-04-28 09:01:34,879 INFO L290 TraceCheckUtils]: 350: Hoare triple {40041#false} ~cond := #in~cond; {40041#false} is VALID [2022-04-28 09:01:34,879 INFO L272 TraceCheckUtils]: 349: Hoare triple {40041#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40041#false} is VALID [2022-04-28 09:01:34,879 INFO L290 TraceCheckUtils]: 348: Hoare triple {40041#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40041#false} is VALID [2022-04-28 09:01:34,879 INFO L290 TraceCheckUtils]: 347: Hoare triple {40041#false} ~i~0 := 0; {40041#false} is VALID [2022-04-28 09:01:34,879 INFO L290 TraceCheckUtils]: 346: Hoare triple {41130#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {40041#false} is VALID [2022-04-28 09:01:34,879 INFO L290 TraceCheckUtils]: 345: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41130#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,880 INFO L290 TraceCheckUtils]: 344: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:34,880 INFO L290 TraceCheckUtils]: 343: Hoare triple {41134#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:34,880 INFO L290 TraceCheckUtils]: 342: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {41134#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:34,881 INFO L290 TraceCheckUtils]: 341: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:34,881 INFO L290 TraceCheckUtils]: 340: Hoare triple {41144#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:34,881 INFO L290 TraceCheckUtils]: 339: Hoare triple {41154#(< 2 main_~edgecount~0)} ~i~0 := 0; {41144#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:34,881 INFO L290 TraceCheckUtils]: 338: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,882 INFO L290 TraceCheckUtils]: 337: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,882 INFO L290 TraceCheckUtils]: 336: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,882 INFO L290 TraceCheckUtils]: 335: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,882 INFO L290 TraceCheckUtils]: 334: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,882 INFO L290 TraceCheckUtils]: 333: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,883 INFO L290 TraceCheckUtils]: 332: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,883 INFO L290 TraceCheckUtils]: 331: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,883 INFO L290 TraceCheckUtils]: 330: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,883 INFO L290 TraceCheckUtils]: 329: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,884 INFO L290 TraceCheckUtils]: 328: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,884 INFO L290 TraceCheckUtils]: 327: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,884 INFO L290 TraceCheckUtils]: 326: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,884 INFO L290 TraceCheckUtils]: 325: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,885 INFO L290 TraceCheckUtils]: 324: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,885 INFO L290 TraceCheckUtils]: 323: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,885 INFO L290 TraceCheckUtils]: 322: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,885 INFO L290 TraceCheckUtils]: 321: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,886 INFO L290 TraceCheckUtils]: 320: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,886 INFO L290 TraceCheckUtils]: 319: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,886 INFO L290 TraceCheckUtils]: 318: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,886 INFO L290 TraceCheckUtils]: 317: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,886 INFO L290 TraceCheckUtils]: 316: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,887 INFO L290 TraceCheckUtils]: 315: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,887 INFO L290 TraceCheckUtils]: 314: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,887 INFO L290 TraceCheckUtils]: 313: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,887 INFO L290 TraceCheckUtils]: 312: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,888 INFO L290 TraceCheckUtils]: 311: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,888 INFO L290 TraceCheckUtils]: 310: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,888 INFO L290 TraceCheckUtils]: 309: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,888 INFO L290 TraceCheckUtils]: 308: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,889 INFO L290 TraceCheckUtils]: 307: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,889 INFO L290 TraceCheckUtils]: 306: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,889 INFO L290 TraceCheckUtils]: 305: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,889 INFO L290 TraceCheckUtils]: 304: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,889 INFO L290 TraceCheckUtils]: 303: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,890 INFO L290 TraceCheckUtils]: 302: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,890 INFO L290 TraceCheckUtils]: 301: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,890 INFO L290 TraceCheckUtils]: 300: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,890 INFO L290 TraceCheckUtils]: 299: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,891 INFO L290 TraceCheckUtils]: 298: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,891 INFO L290 TraceCheckUtils]: 297: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,891 INFO L290 TraceCheckUtils]: 296: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,891 INFO L290 TraceCheckUtils]: 295: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,892 INFO L290 TraceCheckUtils]: 294: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,892 INFO L290 TraceCheckUtils]: 293: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,892 INFO L290 TraceCheckUtils]: 292: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,892 INFO L290 TraceCheckUtils]: 291: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,893 INFO L290 TraceCheckUtils]: 290: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,893 INFO L290 TraceCheckUtils]: 289: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,893 INFO L290 TraceCheckUtils]: 288: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,893 INFO L290 TraceCheckUtils]: 287: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,893 INFO L290 TraceCheckUtils]: 286: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,894 INFO L290 TraceCheckUtils]: 285: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,894 INFO L290 TraceCheckUtils]: 284: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,894 INFO L290 TraceCheckUtils]: 283: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,894 INFO L290 TraceCheckUtils]: 282: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,895 INFO L290 TraceCheckUtils]: 281: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,895 INFO L290 TraceCheckUtils]: 280: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,895 INFO L290 TraceCheckUtils]: 279: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,895 INFO L290 TraceCheckUtils]: 278: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,896 INFO L290 TraceCheckUtils]: 277: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,896 INFO L290 TraceCheckUtils]: 276: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,896 INFO L290 TraceCheckUtils]: 275: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,896 INFO L290 TraceCheckUtils]: 274: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,896 INFO L290 TraceCheckUtils]: 273: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,897 INFO L290 TraceCheckUtils]: 272: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,897 INFO L290 TraceCheckUtils]: 271: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,897 INFO L290 TraceCheckUtils]: 270: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,897 INFO L290 TraceCheckUtils]: 269: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,898 INFO L290 TraceCheckUtils]: 268: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,898 INFO L290 TraceCheckUtils]: 267: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,898 INFO L290 TraceCheckUtils]: 266: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,898 INFO L290 TraceCheckUtils]: 265: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,899 INFO L290 TraceCheckUtils]: 264: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,899 INFO L290 TraceCheckUtils]: 263: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,899 INFO L290 TraceCheckUtils]: 262: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,899 INFO L290 TraceCheckUtils]: 261: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,899 INFO L290 TraceCheckUtils]: 260: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,900 INFO L290 TraceCheckUtils]: 259: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,900 INFO L290 TraceCheckUtils]: 258: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,900 INFO L290 TraceCheckUtils]: 257: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,900 INFO L290 TraceCheckUtils]: 256: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,901 INFO L290 TraceCheckUtils]: 255: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,901 INFO L290 TraceCheckUtils]: 254: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,901 INFO L290 TraceCheckUtils]: 253: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,901 INFO L290 TraceCheckUtils]: 252: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,902 INFO L290 TraceCheckUtils]: 251: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,902 INFO L290 TraceCheckUtils]: 250: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,902 INFO L290 TraceCheckUtils]: 249: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,902 INFO L290 TraceCheckUtils]: 248: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,903 INFO L290 TraceCheckUtils]: 247: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,903 INFO L290 TraceCheckUtils]: 246: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,903 INFO L290 TraceCheckUtils]: 245: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,903 INFO L290 TraceCheckUtils]: 244: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,903 INFO L290 TraceCheckUtils]: 243: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,904 INFO L290 TraceCheckUtils]: 242: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,904 INFO L290 TraceCheckUtils]: 241: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,925 INFO L290 TraceCheckUtils]: 240: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,927 INFO L290 TraceCheckUtils]: 239: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,927 INFO L290 TraceCheckUtils]: 238: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,927 INFO L290 TraceCheckUtils]: 237: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,927 INFO L290 TraceCheckUtils]: 236: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,928 INFO L290 TraceCheckUtils]: 235: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,928 INFO L290 TraceCheckUtils]: 234: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,928 INFO L290 TraceCheckUtils]: 233: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,928 INFO L290 TraceCheckUtils]: 232: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,928 INFO L290 TraceCheckUtils]: 231: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,929 INFO L290 TraceCheckUtils]: 230: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,929 INFO L290 TraceCheckUtils]: 229: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,929 INFO L290 TraceCheckUtils]: 228: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,929 INFO L290 TraceCheckUtils]: 227: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,930 INFO L290 TraceCheckUtils]: 226: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,930 INFO L290 TraceCheckUtils]: 225: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,930 INFO L290 TraceCheckUtils]: 224: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,930 INFO L290 TraceCheckUtils]: 223: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,931 INFO L290 TraceCheckUtils]: 222: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,931 INFO L290 TraceCheckUtils]: 221: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,931 INFO L290 TraceCheckUtils]: 220: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,931 INFO L290 TraceCheckUtils]: 219: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,931 INFO L290 TraceCheckUtils]: 218: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,932 INFO L290 TraceCheckUtils]: 217: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,932 INFO L290 TraceCheckUtils]: 216: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,932 INFO L290 TraceCheckUtils]: 215: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,932 INFO L290 TraceCheckUtils]: 214: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,933 INFO L290 TraceCheckUtils]: 213: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,933 INFO L290 TraceCheckUtils]: 212: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,933 INFO L290 TraceCheckUtils]: 211: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,933 INFO L290 TraceCheckUtils]: 210: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,934 INFO L290 TraceCheckUtils]: 209: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,934 INFO L290 TraceCheckUtils]: 208: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,934 INFO L290 TraceCheckUtils]: 207: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,934 INFO L290 TraceCheckUtils]: 206: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,934 INFO L290 TraceCheckUtils]: 205: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,935 INFO L290 TraceCheckUtils]: 204: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,935 INFO L290 TraceCheckUtils]: 203: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,935 INFO L290 TraceCheckUtils]: 202: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,935 INFO L290 TraceCheckUtils]: 201: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,936 INFO L290 TraceCheckUtils]: 200: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,936 INFO L290 TraceCheckUtils]: 199: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,936 INFO L290 TraceCheckUtils]: 198: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,936 INFO L290 TraceCheckUtils]: 197: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,937 INFO L290 TraceCheckUtils]: 196: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,937 INFO L290 TraceCheckUtils]: 195: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,937 INFO L290 TraceCheckUtils]: 194: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,937 INFO L290 TraceCheckUtils]: 193: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,938 INFO L290 TraceCheckUtils]: 192: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,938 INFO L290 TraceCheckUtils]: 191: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,938 INFO L290 TraceCheckUtils]: 190: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,938 INFO L290 TraceCheckUtils]: 189: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,938 INFO L290 TraceCheckUtils]: 188: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,939 INFO L290 TraceCheckUtils]: 187: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,939 INFO L290 TraceCheckUtils]: 186: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,939 INFO L290 TraceCheckUtils]: 185: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,939 INFO L290 TraceCheckUtils]: 184: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,940 INFO L290 TraceCheckUtils]: 183: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,940 INFO L290 TraceCheckUtils]: 182: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,940 INFO L290 TraceCheckUtils]: 181: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,940 INFO L290 TraceCheckUtils]: 180: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,941 INFO L290 TraceCheckUtils]: 179: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,941 INFO L290 TraceCheckUtils]: 178: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,941 INFO L290 TraceCheckUtils]: 177: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,941 INFO L290 TraceCheckUtils]: 176: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,941 INFO L290 TraceCheckUtils]: 175: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,942 INFO L290 TraceCheckUtils]: 174: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,942 INFO L290 TraceCheckUtils]: 173: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,942 INFO L290 TraceCheckUtils]: 172: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,942 INFO L290 TraceCheckUtils]: 171: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,943 INFO L290 TraceCheckUtils]: 170: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,943 INFO L290 TraceCheckUtils]: 169: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,943 INFO L290 TraceCheckUtils]: 168: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,943 INFO L290 TraceCheckUtils]: 167: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,944 INFO L290 TraceCheckUtils]: 166: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,944 INFO L290 TraceCheckUtils]: 165: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,944 INFO L290 TraceCheckUtils]: 164: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,944 INFO L290 TraceCheckUtils]: 163: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,944 INFO L290 TraceCheckUtils]: 162: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,945 INFO L290 TraceCheckUtils]: 161: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,945 INFO L290 TraceCheckUtils]: 160: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,945 INFO L290 TraceCheckUtils]: 159: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,945 INFO L290 TraceCheckUtils]: 158: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,946 INFO L290 TraceCheckUtils]: 157: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,946 INFO L290 TraceCheckUtils]: 156: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,946 INFO L290 TraceCheckUtils]: 155: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,946 INFO L290 TraceCheckUtils]: 154: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,947 INFO L290 TraceCheckUtils]: 153: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,947 INFO L290 TraceCheckUtils]: 152: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,947 INFO L290 TraceCheckUtils]: 151: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,947 INFO L290 TraceCheckUtils]: 150: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,947 INFO L290 TraceCheckUtils]: 149: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,948 INFO L290 TraceCheckUtils]: 148: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,948 INFO L290 TraceCheckUtils]: 147: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,948 INFO L290 TraceCheckUtils]: 146: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,948 INFO L290 TraceCheckUtils]: 145: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,949 INFO L290 TraceCheckUtils]: 144: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,949 INFO L290 TraceCheckUtils]: 143: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,949 INFO L290 TraceCheckUtils]: 142: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,949 INFO L290 TraceCheckUtils]: 141: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,949 INFO L290 TraceCheckUtils]: 140: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,950 INFO L290 TraceCheckUtils]: 139: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,950 INFO L290 TraceCheckUtils]: 138: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,950 INFO L290 TraceCheckUtils]: 137: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,950 INFO L290 TraceCheckUtils]: 136: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,951 INFO L290 TraceCheckUtils]: 135: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,951 INFO L290 TraceCheckUtils]: 134: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,951 INFO L290 TraceCheckUtils]: 133: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,951 INFO L290 TraceCheckUtils]: 132: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,952 INFO L290 TraceCheckUtils]: 131: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,952 INFO L290 TraceCheckUtils]: 130: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,952 INFO L290 TraceCheckUtils]: 129: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,952 INFO L290 TraceCheckUtils]: 128: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,953 INFO L290 TraceCheckUtils]: 127: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,953 INFO L290 TraceCheckUtils]: 126: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,953 INFO L290 TraceCheckUtils]: 125: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,953 INFO L290 TraceCheckUtils]: 124: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,954 INFO L290 TraceCheckUtils]: 123: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,954 INFO L290 TraceCheckUtils]: 122: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,954 INFO L290 TraceCheckUtils]: 121: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,954 INFO L290 TraceCheckUtils]: 120: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,955 INFO L290 TraceCheckUtils]: 119: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,955 INFO L290 TraceCheckUtils]: 118: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,955 INFO L290 TraceCheckUtils]: 117: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,955 INFO L290 TraceCheckUtils]: 116: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,955 INFO L290 TraceCheckUtils]: 115: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,956 INFO L290 TraceCheckUtils]: 113: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,956 INFO L290 TraceCheckUtils]: 112: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,956 INFO L290 TraceCheckUtils]: 111: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,957 INFO L290 TraceCheckUtils]: 110: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,957 INFO L290 TraceCheckUtils]: 109: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,957 INFO L290 TraceCheckUtils]: 108: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,957 INFO L290 TraceCheckUtils]: 107: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,958 INFO L290 TraceCheckUtils]: 106: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,958 INFO L290 TraceCheckUtils]: 105: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,958 INFO L290 TraceCheckUtils]: 104: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,958 INFO L290 TraceCheckUtils]: 103: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,959 INFO L290 TraceCheckUtils]: 102: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,959 INFO L290 TraceCheckUtils]: 101: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,959 INFO L290 TraceCheckUtils]: 100: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,960 INFO L290 TraceCheckUtils]: 99: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,960 INFO L290 TraceCheckUtils]: 98: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,960 INFO L290 TraceCheckUtils]: 97: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,960 INFO L290 TraceCheckUtils]: 96: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,961 INFO L290 TraceCheckUtils]: 95: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,961 INFO L290 TraceCheckUtils]: 94: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,961 INFO L290 TraceCheckUtils]: 93: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,961 INFO L290 TraceCheckUtils]: 92: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,962 INFO L290 TraceCheckUtils]: 91: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,962 INFO L290 TraceCheckUtils]: 90: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,962 INFO L290 TraceCheckUtils]: 88: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,963 INFO L290 TraceCheckUtils]: 87: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,963 INFO L290 TraceCheckUtils]: 86: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,963 INFO L290 TraceCheckUtils]: 85: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,963 INFO L290 TraceCheckUtils]: 84: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,964 INFO L290 TraceCheckUtils]: 82: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,964 INFO L290 TraceCheckUtils]: 81: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,964 INFO L290 TraceCheckUtils]: 80: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,965 INFO L290 TraceCheckUtils]: 79: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,965 INFO L290 TraceCheckUtils]: 78: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,965 INFO L290 TraceCheckUtils]: 77: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,965 INFO L290 TraceCheckUtils]: 76: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,965 INFO L290 TraceCheckUtils]: 75: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,966 INFO L290 TraceCheckUtils]: 71: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,969 INFO L290 TraceCheckUtils]: 60: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,969 INFO L290 TraceCheckUtils]: 59: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,970 INFO L290 TraceCheckUtils]: 56: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {41154#(< 2 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {41154#(< 2 main_~edgecount~0)} ~i~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {41154#(< 2 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {41154#(< 2 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {41154#(< 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {40040#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {41154#(< 2 main_~edgecount~0)} is VALID [2022-04-28 09:01:34,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {40040#true} call #t~ret22 := main(); {40040#true} is VALID [2022-04-28 09:01:34,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40040#true} {40040#true} #107#return; {40040#true} is VALID [2022-04-28 09:01:34,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {40040#true} assume true; {40040#true} is VALID [2022-04-28 09:01:34,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {40040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40040#true} is VALID [2022-04-28 09:01:34,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {40040#true} call ULTIMATE.init(); {40040#true} is VALID [2022-04-28 09:01:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15425 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:34,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122786298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:34,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:34,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-28 09:01:34,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:34,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318644790] [2022-04-28 09:01:34,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318644790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:34,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:34,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:01:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816587490] [2022-04-28 09:01:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:34,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 353 [2022-04-28 09:01:34,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:34,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:35,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:35,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:01:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:35,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:01:35,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:01:35,008 INFO L87 Difference]: Start difference. First operand 358 states and 467 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:36,666 INFO L93 Difference]: Finished difference Result 386 states and 499 transitions. [2022-04-28 09:01:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:01:36,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 353 [2022-04-28 09:01:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-28 09:01:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-28 09:01:36,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-28 09:01:36,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:36,750 INFO L225 Difference]: With dead ends: 386 [2022-04-28 09:01:36,751 INFO L226 Difference]: Without dead ends: 375 [2022-04-28 09:01:36,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:01:36,751 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 127 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:36,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 39 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-28 09:01:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 361. [2022-04-28 09:01:38,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:38,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:38,138 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:38,138 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:38,143 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-28 09:01:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-28 09:01:38,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:38,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:38,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-04-28 09:01:38,144 INFO L87 Difference]: Start difference. First operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-04-28 09:01:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:38,149 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2022-04-28 09:01:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 487 transitions. [2022-04-28 09:01:38,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:38,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:38,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:38,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 355 states have (on average 1.3098591549295775) internal successors, (465), 355 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 470 transitions. [2022-04-28 09:01:38,155 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 470 transitions. Word has length 353 [2022-04-28 09:01:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:38,155 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 470 transitions. [2022-04-28 09:01:38,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:38,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 470 transitions. [2022-04-28 09:01:38,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 470 transitions. [2022-04-28 09:01:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2022-04-28 09:01:38,905 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:38,905 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:38,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:39,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 09:01:39,106 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 57 times [2022-04-28 09:01:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:39,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724177962] [2022-04-28 09:01:39,110 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:39,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1152690534, now seen corresponding path program 58 times [2022-04-28 09:01:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:39,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728147646] [2022-04-28 09:01:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:39,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-28 09:01:39,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-28 09:01:39,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-28 09:01:39,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:39,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {44436#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-28 09:01:39,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-28 09:01:39,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-28 09:01:39,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-28 09:01:39,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,439 INFO L290 TraceCheckUtils]: 60: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,440 INFO L290 TraceCheckUtils]: 66: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,442 INFO L290 TraceCheckUtils]: 70: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,442 INFO L290 TraceCheckUtils]: 71: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,442 INFO L290 TraceCheckUtils]: 72: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,443 INFO L290 TraceCheckUtils]: 73: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,443 INFO L290 TraceCheckUtils]: 75: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,443 INFO L290 TraceCheckUtils]: 76: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,444 INFO L290 TraceCheckUtils]: 78: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,444 INFO L290 TraceCheckUtils]: 79: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,444 INFO L290 TraceCheckUtils]: 80: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,444 INFO L290 TraceCheckUtils]: 81: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,445 INFO L290 TraceCheckUtils]: 82: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,445 INFO L290 TraceCheckUtils]: 83: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,445 INFO L290 TraceCheckUtils]: 84: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,445 INFO L290 TraceCheckUtils]: 85: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,446 INFO L290 TraceCheckUtils]: 87: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,446 INFO L290 TraceCheckUtils]: 88: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,446 INFO L290 TraceCheckUtils]: 89: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,446 INFO L290 TraceCheckUtils]: 90: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,447 INFO L290 TraceCheckUtils]: 91: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,447 INFO L290 TraceCheckUtils]: 93: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,447 INFO L290 TraceCheckUtils]: 94: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,447 INFO L290 TraceCheckUtils]: 95: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,448 INFO L290 TraceCheckUtils]: 96: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,448 INFO L290 TraceCheckUtils]: 97: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,448 INFO L290 TraceCheckUtils]: 98: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,448 INFO L290 TraceCheckUtils]: 99: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,449 INFO L290 TraceCheckUtils]: 100: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,449 INFO L290 TraceCheckUtils]: 101: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,449 INFO L290 TraceCheckUtils]: 102: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,449 INFO L290 TraceCheckUtils]: 103: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,449 INFO L290 TraceCheckUtils]: 104: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,450 INFO L290 TraceCheckUtils]: 105: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,450 INFO L290 TraceCheckUtils]: 106: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,450 INFO L290 TraceCheckUtils]: 107: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,450 INFO L290 TraceCheckUtils]: 108: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,450 INFO L290 TraceCheckUtils]: 109: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,451 INFO L290 TraceCheckUtils]: 110: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,451 INFO L290 TraceCheckUtils]: 111: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,451 INFO L290 TraceCheckUtils]: 112: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,451 INFO L290 TraceCheckUtils]: 113: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,451 INFO L290 TraceCheckUtils]: 114: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,452 INFO L290 TraceCheckUtils]: 115: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,452 INFO L290 TraceCheckUtils]: 116: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,452 INFO L290 TraceCheckUtils]: 117: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,452 INFO L290 TraceCheckUtils]: 118: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,452 INFO L290 TraceCheckUtils]: 119: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,453 INFO L290 TraceCheckUtils]: 120: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,453 INFO L290 TraceCheckUtils]: 121: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,453 INFO L290 TraceCheckUtils]: 122: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,453 INFO L290 TraceCheckUtils]: 123: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,453 INFO L290 TraceCheckUtils]: 124: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,454 INFO L290 TraceCheckUtils]: 125: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,454 INFO L290 TraceCheckUtils]: 126: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,454 INFO L290 TraceCheckUtils]: 127: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,454 INFO L290 TraceCheckUtils]: 128: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,454 INFO L290 TraceCheckUtils]: 129: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,455 INFO L290 TraceCheckUtils]: 130: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,455 INFO L290 TraceCheckUtils]: 131: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,455 INFO L290 TraceCheckUtils]: 132: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,455 INFO L290 TraceCheckUtils]: 133: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,455 INFO L290 TraceCheckUtils]: 134: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,456 INFO L290 TraceCheckUtils]: 135: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,456 INFO L290 TraceCheckUtils]: 136: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,456 INFO L290 TraceCheckUtils]: 137: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,456 INFO L290 TraceCheckUtils]: 138: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,456 INFO L290 TraceCheckUtils]: 139: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,457 INFO L290 TraceCheckUtils]: 140: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,457 INFO L290 TraceCheckUtils]: 141: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,457 INFO L290 TraceCheckUtils]: 142: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,457 INFO L290 TraceCheckUtils]: 143: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,457 INFO L290 TraceCheckUtils]: 144: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,458 INFO L290 TraceCheckUtils]: 145: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,458 INFO L290 TraceCheckUtils]: 146: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,458 INFO L290 TraceCheckUtils]: 147: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,458 INFO L290 TraceCheckUtils]: 148: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,459 INFO L290 TraceCheckUtils]: 149: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,459 INFO L290 TraceCheckUtils]: 150: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,459 INFO L290 TraceCheckUtils]: 151: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,459 INFO L290 TraceCheckUtils]: 152: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,459 INFO L290 TraceCheckUtils]: 153: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,460 INFO L290 TraceCheckUtils]: 154: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,460 INFO L290 TraceCheckUtils]: 155: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,460 INFO L290 TraceCheckUtils]: 156: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,460 INFO L290 TraceCheckUtils]: 157: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,460 INFO L290 TraceCheckUtils]: 158: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,461 INFO L290 TraceCheckUtils]: 159: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,461 INFO L290 TraceCheckUtils]: 160: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,461 INFO L290 TraceCheckUtils]: 161: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,461 INFO L290 TraceCheckUtils]: 162: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,461 INFO L290 TraceCheckUtils]: 163: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,462 INFO L290 TraceCheckUtils]: 164: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,462 INFO L290 TraceCheckUtils]: 165: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,462 INFO L290 TraceCheckUtils]: 166: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,462 INFO L290 TraceCheckUtils]: 167: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,462 INFO L290 TraceCheckUtils]: 168: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,463 INFO L290 TraceCheckUtils]: 169: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,463 INFO L290 TraceCheckUtils]: 170: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,463 INFO L290 TraceCheckUtils]: 171: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,463 INFO L290 TraceCheckUtils]: 172: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,463 INFO L290 TraceCheckUtils]: 173: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,464 INFO L290 TraceCheckUtils]: 174: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,464 INFO L290 TraceCheckUtils]: 175: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,464 INFO L290 TraceCheckUtils]: 176: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,464 INFO L290 TraceCheckUtils]: 177: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,464 INFO L290 TraceCheckUtils]: 178: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,465 INFO L290 TraceCheckUtils]: 179: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,465 INFO L290 TraceCheckUtils]: 180: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,465 INFO L290 TraceCheckUtils]: 181: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,465 INFO L290 TraceCheckUtils]: 182: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,465 INFO L290 TraceCheckUtils]: 183: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,466 INFO L290 TraceCheckUtils]: 184: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,466 INFO L290 TraceCheckUtils]: 185: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,466 INFO L290 TraceCheckUtils]: 186: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,466 INFO L290 TraceCheckUtils]: 187: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,466 INFO L290 TraceCheckUtils]: 188: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,467 INFO L290 TraceCheckUtils]: 189: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,467 INFO L290 TraceCheckUtils]: 190: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,467 INFO L290 TraceCheckUtils]: 191: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,467 INFO L290 TraceCheckUtils]: 192: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,467 INFO L290 TraceCheckUtils]: 193: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,468 INFO L290 TraceCheckUtils]: 194: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,468 INFO L290 TraceCheckUtils]: 195: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,468 INFO L290 TraceCheckUtils]: 196: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,468 INFO L290 TraceCheckUtils]: 197: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,469 INFO L290 TraceCheckUtils]: 198: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,469 INFO L290 TraceCheckUtils]: 199: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,469 INFO L290 TraceCheckUtils]: 200: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,469 INFO L290 TraceCheckUtils]: 201: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,469 INFO L290 TraceCheckUtils]: 202: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,470 INFO L290 TraceCheckUtils]: 203: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,470 INFO L290 TraceCheckUtils]: 204: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,470 INFO L290 TraceCheckUtils]: 205: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,470 INFO L290 TraceCheckUtils]: 206: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,470 INFO L290 TraceCheckUtils]: 207: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,471 INFO L290 TraceCheckUtils]: 208: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,471 INFO L290 TraceCheckUtils]: 209: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,471 INFO L290 TraceCheckUtils]: 210: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,471 INFO L290 TraceCheckUtils]: 211: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,471 INFO L290 TraceCheckUtils]: 212: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,472 INFO L290 TraceCheckUtils]: 213: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,472 INFO L290 TraceCheckUtils]: 214: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,472 INFO L290 TraceCheckUtils]: 215: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,472 INFO L290 TraceCheckUtils]: 216: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,472 INFO L290 TraceCheckUtils]: 217: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,473 INFO L290 TraceCheckUtils]: 218: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,473 INFO L290 TraceCheckUtils]: 219: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,473 INFO L290 TraceCheckUtils]: 220: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,473 INFO L290 TraceCheckUtils]: 221: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,473 INFO L290 TraceCheckUtils]: 222: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,474 INFO L290 TraceCheckUtils]: 223: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,474 INFO L290 TraceCheckUtils]: 224: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,474 INFO L290 TraceCheckUtils]: 225: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,474 INFO L290 TraceCheckUtils]: 226: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,474 INFO L290 TraceCheckUtils]: 227: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,475 INFO L290 TraceCheckUtils]: 228: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,475 INFO L290 TraceCheckUtils]: 229: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,475 INFO L290 TraceCheckUtils]: 230: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,475 INFO L290 TraceCheckUtils]: 231: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,475 INFO L290 TraceCheckUtils]: 232: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,476 INFO L290 TraceCheckUtils]: 233: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,476 INFO L290 TraceCheckUtils]: 234: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,476 INFO L290 TraceCheckUtils]: 235: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,476 INFO L290 TraceCheckUtils]: 236: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,476 INFO L290 TraceCheckUtils]: 237: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,477 INFO L290 TraceCheckUtils]: 238: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,477 INFO L290 TraceCheckUtils]: 239: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,477 INFO L290 TraceCheckUtils]: 240: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,477 INFO L290 TraceCheckUtils]: 241: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,477 INFO L290 TraceCheckUtils]: 242: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,478 INFO L290 TraceCheckUtils]: 243: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,478 INFO L290 TraceCheckUtils]: 244: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,478 INFO L290 TraceCheckUtils]: 245: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,478 INFO L290 TraceCheckUtils]: 246: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,479 INFO L290 TraceCheckUtils]: 247: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,479 INFO L290 TraceCheckUtils]: 248: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,479 INFO L290 TraceCheckUtils]: 249: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,479 INFO L290 TraceCheckUtils]: 250: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,479 INFO L290 TraceCheckUtils]: 251: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,480 INFO L290 TraceCheckUtils]: 252: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,480 INFO L290 TraceCheckUtils]: 253: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,480 INFO L290 TraceCheckUtils]: 254: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,480 INFO L290 TraceCheckUtils]: 255: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,480 INFO L290 TraceCheckUtils]: 256: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,481 INFO L290 TraceCheckUtils]: 257: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,481 INFO L290 TraceCheckUtils]: 258: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,481 INFO L290 TraceCheckUtils]: 259: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,481 INFO L290 TraceCheckUtils]: 260: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,481 INFO L290 TraceCheckUtils]: 261: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,482 INFO L290 TraceCheckUtils]: 262: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,482 INFO L290 TraceCheckUtils]: 263: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,482 INFO L290 TraceCheckUtils]: 264: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,482 INFO L290 TraceCheckUtils]: 265: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,482 INFO L290 TraceCheckUtils]: 266: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,483 INFO L290 TraceCheckUtils]: 267: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,483 INFO L290 TraceCheckUtils]: 268: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,483 INFO L290 TraceCheckUtils]: 269: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,483 INFO L290 TraceCheckUtils]: 270: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,483 INFO L290 TraceCheckUtils]: 271: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,484 INFO L290 TraceCheckUtils]: 272: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,484 INFO L290 TraceCheckUtils]: 273: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,484 INFO L290 TraceCheckUtils]: 274: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,484 INFO L290 TraceCheckUtils]: 275: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,484 INFO L290 TraceCheckUtils]: 276: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,485 INFO L290 TraceCheckUtils]: 277: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,485 INFO L290 TraceCheckUtils]: 278: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,485 INFO L290 TraceCheckUtils]: 279: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,485 INFO L290 TraceCheckUtils]: 280: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,485 INFO L290 TraceCheckUtils]: 281: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,486 INFO L290 TraceCheckUtils]: 282: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,486 INFO L290 TraceCheckUtils]: 283: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,486 INFO L290 TraceCheckUtils]: 284: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,486 INFO L290 TraceCheckUtils]: 285: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,486 INFO L290 TraceCheckUtils]: 286: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,487 INFO L290 TraceCheckUtils]: 287: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,487 INFO L290 TraceCheckUtils]: 288: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,487 INFO L290 TraceCheckUtils]: 289: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,487 INFO L290 TraceCheckUtils]: 290: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,488 INFO L290 TraceCheckUtils]: 291: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,488 INFO L290 TraceCheckUtils]: 292: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,488 INFO L290 TraceCheckUtils]: 293: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,488 INFO L290 TraceCheckUtils]: 294: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,488 INFO L290 TraceCheckUtils]: 295: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,489 INFO L290 TraceCheckUtils]: 296: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,489 INFO L290 TraceCheckUtils]: 297: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,489 INFO L290 TraceCheckUtils]: 298: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,489 INFO L290 TraceCheckUtils]: 299: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,489 INFO L290 TraceCheckUtils]: 300: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,490 INFO L290 TraceCheckUtils]: 301: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,490 INFO L290 TraceCheckUtils]: 302: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,490 INFO L290 TraceCheckUtils]: 303: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,490 INFO L290 TraceCheckUtils]: 304: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,490 INFO L290 TraceCheckUtils]: 305: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,491 INFO L290 TraceCheckUtils]: 306: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,491 INFO L290 TraceCheckUtils]: 307: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,491 INFO L290 TraceCheckUtils]: 308: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,491 INFO L290 TraceCheckUtils]: 309: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,491 INFO L290 TraceCheckUtils]: 310: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,492 INFO L290 TraceCheckUtils]: 311: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,492 INFO L290 TraceCheckUtils]: 312: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,492 INFO L290 TraceCheckUtils]: 313: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,492 INFO L290 TraceCheckUtils]: 314: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,492 INFO L290 TraceCheckUtils]: 315: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,493 INFO L290 TraceCheckUtils]: 316: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,493 INFO L290 TraceCheckUtils]: 317: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,493 INFO L290 TraceCheckUtils]: 318: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,493 INFO L290 TraceCheckUtils]: 319: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,493 INFO L290 TraceCheckUtils]: 320: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,494 INFO L290 TraceCheckUtils]: 321: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,494 INFO L290 TraceCheckUtils]: 322: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,494 INFO L290 TraceCheckUtils]: 323: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,494 INFO L290 TraceCheckUtils]: 324: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,494 INFO L290 TraceCheckUtils]: 325: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,495 INFO L290 TraceCheckUtils]: 326: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,495 INFO L290 TraceCheckUtils]: 327: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,495 INFO L290 TraceCheckUtils]: 328: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,495 INFO L290 TraceCheckUtils]: 329: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,495 INFO L290 TraceCheckUtils]: 330: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,496 INFO L290 TraceCheckUtils]: 331: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,496 INFO L290 TraceCheckUtils]: 332: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,496 INFO L290 TraceCheckUtils]: 333: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,496 INFO L290 TraceCheckUtils]: 334: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,496 INFO L290 TraceCheckUtils]: 335: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,497 INFO L290 TraceCheckUtils]: 336: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,497 INFO L290 TraceCheckUtils]: 337: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,497 INFO L290 TraceCheckUtils]: 338: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {44431#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:01:39,497 INFO L290 TraceCheckUtils]: 339: Hoare triple {44431#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:39,498 INFO L290 TraceCheckUtils]: 340: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:39,498 INFO L290 TraceCheckUtils]: 341: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:39,498 INFO L290 TraceCheckUtils]: 342: Hoare triple {44432#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:01:39,499 INFO L290 TraceCheckUtils]: 343: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:01:39,499 INFO L290 TraceCheckUtils]: 344: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:01:39,499 INFO L290 TraceCheckUtils]: 345: Hoare triple {44433#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:39,500 INFO L290 TraceCheckUtils]: 346: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:39,500 INFO L290 TraceCheckUtils]: 347: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:39,501 INFO L290 TraceCheckUtils]: 348: Hoare triple {44434#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {44435#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:39,501 INFO L290 TraceCheckUtils]: 349: Hoare triple {44435#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-28 09:01:39,501 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-28 09:01:39,501 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-28 09:01:39,501 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-28 09:01:39,501 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-28 09:01:39,501 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-28 09:01:39,501 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-28 09:01:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:39,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728147646] [2022-04-28 09:01:39,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728147646] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:39,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769447410] [2022-04-28 09:01:39,502 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:01:39,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:39,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:39,503 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:39,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 09:01:40,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:01:40,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:40,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 09:01:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:40,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:41,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-28 09:01:41,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-28 09:01:41,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-28 09:01:41,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-28 09:01:41,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-28 09:01:41,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44426#true} is VALID [2022-04-28 09:01:41,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:41,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {44426#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:41,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-28 09:01:41,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44509#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:41,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {44509#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44509#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:41,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {44509#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44509#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:41,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {44509#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44519#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:41,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {44519#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44519#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:41,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {44519#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44519#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:41,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {44519#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44529#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:41,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {44529#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44529#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:41,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {44529#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44529#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:41,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {44529#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44539#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:41,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {44539#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44539#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:41,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {44539#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44539#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:41,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {44539#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44549#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:41,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {44549#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44549#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:41,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {44549#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44549#(<= 4 main_~j~0)} is VALID [2022-04-28 09:01:41,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {44549#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44559#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:41,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {44559#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44559#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:41,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {44559#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44559#(<= 5 main_~j~0)} is VALID [2022-04-28 09:01:41,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {44559#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44569#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:41,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {44569#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44569#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:41,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {44569#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44569#(<= 6 main_~j~0)} is VALID [2022-04-28 09:01:41,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {44569#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44579#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:41,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {44579#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44579#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:41,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {44579#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44579#(<= 7 main_~j~0)} is VALID [2022-04-28 09:01:41,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {44579#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44589#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:41,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {44589#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44589#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:41,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {44589#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44589#(<= 8 main_~j~0)} is VALID [2022-04-28 09:01:41,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {44589#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44599#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:41,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {44599#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44599#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:41,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {44599#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44599#(<= 9 main_~j~0)} is VALID [2022-04-28 09:01:41,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {44599#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44609#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:41,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {44609#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44609#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:41,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {44609#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44609#(<= 10 main_~j~0)} is VALID [2022-04-28 09:01:41,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {44609#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44619#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:41,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {44619#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44619#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:41,455 INFO L290 TraceCheckUtils]: 58: Hoare triple {44619#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44619#(<= 11 main_~j~0)} is VALID [2022-04-28 09:01:41,455 INFO L290 TraceCheckUtils]: 59: Hoare triple {44619#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44629#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:41,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {44629#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44629#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:41,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {44629#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44629#(<= 12 main_~j~0)} is VALID [2022-04-28 09:01:41,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {44629#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44639#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:41,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {44639#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44639#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:41,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {44639#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44639#(<= 13 main_~j~0)} is VALID [2022-04-28 09:01:41,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {44639#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44649#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:41,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {44649#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44649#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:41,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {44649#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44649#(<= 14 main_~j~0)} is VALID [2022-04-28 09:01:41,458 INFO L290 TraceCheckUtils]: 68: Hoare triple {44649#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44659#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:41,458 INFO L290 TraceCheckUtils]: 69: Hoare triple {44659#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44659#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:41,458 INFO L290 TraceCheckUtils]: 70: Hoare triple {44659#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44659#(<= 15 main_~j~0)} is VALID [2022-04-28 09:01:41,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {44659#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44669#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:41,459 INFO L290 TraceCheckUtils]: 72: Hoare triple {44669#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44669#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:41,459 INFO L290 TraceCheckUtils]: 73: Hoare triple {44669#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44669#(<= 16 main_~j~0)} is VALID [2022-04-28 09:01:41,459 INFO L290 TraceCheckUtils]: 74: Hoare triple {44669#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44679#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:41,460 INFO L290 TraceCheckUtils]: 75: Hoare triple {44679#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44679#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:41,460 INFO L290 TraceCheckUtils]: 76: Hoare triple {44679#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44679#(<= 17 main_~j~0)} is VALID [2022-04-28 09:01:41,460 INFO L290 TraceCheckUtils]: 77: Hoare triple {44679#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44689#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:41,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {44689#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44689#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:41,461 INFO L290 TraceCheckUtils]: 79: Hoare triple {44689#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44689#(<= 18 main_~j~0)} is VALID [2022-04-28 09:01:41,461 INFO L290 TraceCheckUtils]: 80: Hoare triple {44689#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44699#(<= 19 main_~j~0)} is VALID [2022-04-28 09:01:41,462 INFO L290 TraceCheckUtils]: 81: Hoare triple {44699#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,462 INFO L290 TraceCheckUtils]: 82: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,463 INFO L290 TraceCheckUtils]: 86: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,463 INFO L290 TraceCheckUtils]: 87: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,465 INFO L290 TraceCheckUtils]: 94: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,465 INFO L290 TraceCheckUtils]: 95: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,465 INFO L290 TraceCheckUtils]: 96: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,465 INFO L290 TraceCheckUtils]: 97: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,466 INFO L290 TraceCheckUtils]: 98: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,466 INFO L290 TraceCheckUtils]: 99: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,466 INFO L290 TraceCheckUtils]: 100: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,466 INFO L290 TraceCheckUtils]: 101: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,466 INFO L290 TraceCheckUtils]: 102: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,467 INFO L290 TraceCheckUtils]: 103: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,467 INFO L290 TraceCheckUtils]: 104: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,467 INFO L290 TraceCheckUtils]: 105: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,467 INFO L290 TraceCheckUtils]: 106: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,468 INFO L290 TraceCheckUtils]: 107: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,468 INFO L290 TraceCheckUtils]: 108: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,468 INFO L290 TraceCheckUtils]: 109: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,468 INFO L290 TraceCheckUtils]: 110: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,469 INFO L290 TraceCheckUtils]: 111: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,469 INFO L290 TraceCheckUtils]: 112: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,469 INFO L290 TraceCheckUtils]: 113: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,470 INFO L290 TraceCheckUtils]: 114: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,470 INFO L290 TraceCheckUtils]: 115: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,471 INFO L290 TraceCheckUtils]: 116: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,471 INFO L290 TraceCheckUtils]: 117: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,471 INFO L290 TraceCheckUtils]: 118: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,471 INFO L290 TraceCheckUtils]: 119: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,472 INFO L290 TraceCheckUtils]: 120: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,472 INFO L290 TraceCheckUtils]: 121: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,472 INFO L290 TraceCheckUtils]: 122: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,472 INFO L290 TraceCheckUtils]: 123: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,472 INFO L290 TraceCheckUtils]: 124: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,473 INFO L290 TraceCheckUtils]: 125: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,473 INFO L290 TraceCheckUtils]: 126: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,473 INFO L290 TraceCheckUtils]: 127: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,473 INFO L290 TraceCheckUtils]: 128: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,474 INFO L290 TraceCheckUtils]: 129: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,474 INFO L290 TraceCheckUtils]: 130: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,474 INFO L290 TraceCheckUtils]: 131: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,474 INFO L290 TraceCheckUtils]: 132: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,475 INFO L290 TraceCheckUtils]: 133: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,475 INFO L290 TraceCheckUtils]: 134: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,475 INFO L290 TraceCheckUtils]: 135: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,475 INFO L290 TraceCheckUtils]: 136: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,476 INFO L290 TraceCheckUtils]: 137: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,476 INFO L290 TraceCheckUtils]: 138: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,476 INFO L290 TraceCheckUtils]: 139: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,476 INFO L290 TraceCheckUtils]: 140: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,476 INFO L290 TraceCheckUtils]: 141: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,477 INFO L290 TraceCheckUtils]: 142: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,477 INFO L290 TraceCheckUtils]: 143: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,477 INFO L290 TraceCheckUtils]: 144: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,477 INFO L290 TraceCheckUtils]: 145: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,478 INFO L290 TraceCheckUtils]: 146: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,478 INFO L290 TraceCheckUtils]: 147: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,478 INFO L290 TraceCheckUtils]: 148: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,478 INFO L290 TraceCheckUtils]: 149: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,479 INFO L290 TraceCheckUtils]: 150: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,479 INFO L290 TraceCheckUtils]: 151: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,479 INFO L290 TraceCheckUtils]: 152: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,479 INFO L290 TraceCheckUtils]: 153: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,479 INFO L290 TraceCheckUtils]: 154: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,480 INFO L290 TraceCheckUtils]: 155: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,480 INFO L290 TraceCheckUtils]: 156: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,480 INFO L290 TraceCheckUtils]: 157: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,480 INFO L290 TraceCheckUtils]: 158: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,481 INFO L290 TraceCheckUtils]: 159: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,481 INFO L290 TraceCheckUtils]: 160: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,481 INFO L290 TraceCheckUtils]: 161: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,481 INFO L290 TraceCheckUtils]: 162: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,482 INFO L290 TraceCheckUtils]: 163: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,482 INFO L290 TraceCheckUtils]: 164: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,482 INFO L290 TraceCheckUtils]: 165: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,482 INFO L290 TraceCheckUtils]: 166: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,482 INFO L290 TraceCheckUtils]: 167: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,483 INFO L290 TraceCheckUtils]: 168: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,483 INFO L290 TraceCheckUtils]: 169: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,483 INFO L290 TraceCheckUtils]: 170: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,483 INFO L290 TraceCheckUtils]: 171: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,484 INFO L290 TraceCheckUtils]: 172: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,484 INFO L290 TraceCheckUtils]: 173: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,484 INFO L290 TraceCheckUtils]: 174: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,484 INFO L290 TraceCheckUtils]: 175: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,485 INFO L290 TraceCheckUtils]: 176: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,485 INFO L290 TraceCheckUtils]: 177: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,485 INFO L290 TraceCheckUtils]: 178: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,485 INFO L290 TraceCheckUtils]: 179: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,485 INFO L290 TraceCheckUtils]: 180: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,486 INFO L290 TraceCheckUtils]: 181: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,486 INFO L290 TraceCheckUtils]: 182: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,486 INFO L290 TraceCheckUtils]: 183: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,486 INFO L290 TraceCheckUtils]: 184: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,487 INFO L290 TraceCheckUtils]: 185: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,487 INFO L290 TraceCheckUtils]: 186: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,487 INFO L290 TraceCheckUtils]: 187: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,487 INFO L290 TraceCheckUtils]: 188: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,488 INFO L290 TraceCheckUtils]: 189: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,488 INFO L290 TraceCheckUtils]: 190: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,488 INFO L290 TraceCheckUtils]: 191: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,488 INFO L290 TraceCheckUtils]: 192: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,488 INFO L290 TraceCheckUtils]: 193: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,489 INFO L290 TraceCheckUtils]: 194: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,489 INFO L290 TraceCheckUtils]: 195: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,489 INFO L290 TraceCheckUtils]: 196: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,489 INFO L290 TraceCheckUtils]: 197: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,490 INFO L290 TraceCheckUtils]: 198: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,490 INFO L290 TraceCheckUtils]: 199: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,490 INFO L290 TraceCheckUtils]: 200: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,490 INFO L290 TraceCheckUtils]: 201: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,490 INFO L290 TraceCheckUtils]: 202: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,491 INFO L290 TraceCheckUtils]: 203: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,491 INFO L290 TraceCheckUtils]: 204: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,491 INFO L290 TraceCheckUtils]: 205: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,491 INFO L290 TraceCheckUtils]: 206: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,492 INFO L290 TraceCheckUtils]: 207: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,492 INFO L290 TraceCheckUtils]: 208: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,492 INFO L290 TraceCheckUtils]: 209: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,492 INFO L290 TraceCheckUtils]: 210: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,493 INFO L290 TraceCheckUtils]: 211: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,493 INFO L290 TraceCheckUtils]: 212: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,493 INFO L290 TraceCheckUtils]: 213: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,493 INFO L290 TraceCheckUtils]: 214: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,493 INFO L290 TraceCheckUtils]: 215: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,494 INFO L290 TraceCheckUtils]: 216: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,494 INFO L290 TraceCheckUtils]: 217: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,494 INFO L290 TraceCheckUtils]: 218: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,494 INFO L290 TraceCheckUtils]: 219: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,495 INFO L290 TraceCheckUtils]: 220: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,495 INFO L290 TraceCheckUtils]: 221: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,495 INFO L290 TraceCheckUtils]: 222: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,495 INFO L290 TraceCheckUtils]: 223: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,495 INFO L290 TraceCheckUtils]: 224: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,496 INFO L290 TraceCheckUtils]: 225: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,496 INFO L290 TraceCheckUtils]: 226: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,496 INFO L290 TraceCheckUtils]: 227: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,496 INFO L290 TraceCheckUtils]: 228: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,497 INFO L290 TraceCheckUtils]: 229: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,497 INFO L290 TraceCheckUtils]: 230: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,497 INFO L290 TraceCheckUtils]: 231: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,497 INFO L290 TraceCheckUtils]: 232: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,498 INFO L290 TraceCheckUtils]: 233: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,498 INFO L290 TraceCheckUtils]: 234: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,498 INFO L290 TraceCheckUtils]: 235: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,498 INFO L290 TraceCheckUtils]: 236: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,498 INFO L290 TraceCheckUtils]: 237: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,499 INFO L290 TraceCheckUtils]: 238: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,499 INFO L290 TraceCheckUtils]: 239: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,499 INFO L290 TraceCheckUtils]: 240: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,499 INFO L290 TraceCheckUtils]: 241: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,500 INFO L290 TraceCheckUtils]: 242: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,500 INFO L290 TraceCheckUtils]: 243: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,500 INFO L290 TraceCheckUtils]: 244: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,500 INFO L290 TraceCheckUtils]: 245: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,500 INFO L290 TraceCheckUtils]: 246: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,501 INFO L290 TraceCheckUtils]: 247: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,501 INFO L290 TraceCheckUtils]: 248: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,501 INFO L290 TraceCheckUtils]: 249: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,501 INFO L290 TraceCheckUtils]: 250: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,502 INFO L290 TraceCheckUtils]: 251: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,502 INFO L290 TraceCheckUtils]: 252: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,502 INFO L290 TraceCheckUtils]: 253: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,502 INFO L290 TraceCheckUtils]: 254: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,503 INFO L290 TraceCheckUtils]: 255: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,503 INFO L290 TraceCheckUtils]: 256: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,503 INFO L290 TraceCheckUtils]: 257: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,503 INFO L290 TraceCheckUtils]: 258: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,503 INFO L290 TraceCheckUtils]: 259: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,504 INFO L290 TraceCheckUtils]: 260: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,504 INFO L290 TraceCheckUtils]: 261: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,504 INFO L290 TraceCheckUtils]: 262: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,504 INFO L290 TraceCheckUtils]: 263: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,505 INFO L290 TraceCheckUtils]: 264: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,505 INFO L290 TraceCheckUtils]: 265: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,505 INFO L290 TraceCheckUtils]: 266: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,505 INFO L290 TraceCheckUtils]: 267: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,505 INFO L290 TraceCheckUtils]: 268: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,506 INFO L290 TraceCheckUtils]: 269: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,506 INFO L290 TraceCheckUtils]: 270: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,506 INFO L290 TraceCheckUtils]: 271: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,506 INFO L290 TraceCheckUtils]: 272: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,507 INFO L290 TraceCheckUtils]: 273: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,507 INFO L290 TraceCheckUtils]: 274: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,507 INFO L290 TraceCheckUtils]: 275: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,507 INFO L290 TraceCheckUtils]: 276: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,508 INFO L290 TraceCheckUtils]: 277: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,508 INFO L290 TraceCheckUtils]: 278: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,508 INFO L290 TraceCheckUtils]: 279: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,508 INFO L290 TraceCheckUtils]: 280: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,508 INFO L290 TraceCheckUtils]: 281: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,509 INFO L290 TraceCheckUtils]: 282: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,509 INFO L290 TraceCheckUtils]: 283: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,509 INFO L290 TraceCheckUtils]: 284: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,509 INFO L290 TraceCheckUtils]: 285: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,510 INFO L290 TraceCheckUtils]: 286: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,510 INFO L290 TraceCheckUtils]: 287: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,510 INFO L290 TraceCheckUtils]: 288: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,510 INFO L290 TraceCheckUtils]: 289: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,511 INFO L290 TraceCheckUtils]: 290: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,511 INFO L290 TraceCheckUtils]: 291: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,511 INFO L290 TraceCheckUtils]: 292: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,511 INFO L290 TraceCheckUtils]: 293: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,511 INFO L290 TraceCheckUtils]: 294: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,512 INFO L290 TraceCheckUtils]: 295: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,512 INFO L290 TraceCheckUtils]: 296: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,512 INFO L290 TraceCheckUtils]: 297: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,512 INFO L290 TraceCheckUtils]: 298: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,513 INFO L290 TraceCheckUtils]: 299: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,513 INFO L290 TraceCheckUtils]: 300: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,513 INFO L290 TraceCheckUtils]: 301: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,513 INFO L290 TraceCheckUtils]: 302: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,514 INFO L290 TraceCheckUtils]: 303: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,514 INFO L290 TraceCheckUtils]: 304: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,514 INFO L290 TraceCheckUtils]: 305: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,514 INFO L290 TraceCheckUtils]: 306: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,514 INFO L290 TraceCheckUtils]: 307: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,515 INFO L290 TraceCheckUtils]: 308: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,515 INFO L290 TraceCheckUtils]: 309: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,515 INFO L290 TraceCheckUtils]: 310: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,515 INFO L290 TraceCheckUtils]: 311: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,516 INFO L290 TraceCheckUtils]: 312: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,516 INFO L290 TraceCheckUtils]: 313: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,516 INFO L290 TraceCheckUtils]: 314: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,516 INFO L290 TraceCheckUtils]: 315: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,517 INFO L290 TraceCheckUtils]: 316: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,517 INFO L290 TraceCheckUtils]: 317: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,517 INFO L290 TraceCheckUtils]: 318: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,517 INFO L290 TraceCheckUtils]: 319: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,517 INFO L290 TraceCheckUtils]: 320: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,518 INFO L290 TraceCheckUtils]: 321: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,518 INFO L290 TraceCheckUtils]: 322: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,518 INFO L290 TraceCheckUtils]: 323: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,518 INFO L290 TraceCheckUtils]: 324: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,519 INFO L290 TraceCheckUtils]: 325: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,519 INFO L290 TraceCheckUtils]: 326: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,519 INFO L290 TraceCheckUtils]: 327: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,519 INFO L290 TraceCheckUtils]: 328: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,520 INFO L290 TraceCheckUtils]: 329: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,520 INFO L290 TraceCheckUtils]: 330: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,520 INFO L290 TraceCheckUtils]: 331: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,520 INFO L290 TraceCheckUtils]: 332: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,520 INFO L290 TraceCheckUtils]: 333: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,521 INFO L290 TraceCheckUtils]: 334: Hoare triple {44703#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,521 INFO L290 TraceCheckUtils]: 335: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,521 INFO L290 TraceCheckUtils]: 336: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,521 INFO L290 TraceCheckUtils]: 337: Hoare triple {44703#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,522 INFO L290 TraceCheckUtils]: 338: Hoare triple {44703#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {44703#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:01:41,522 INFO L290 TraceCheckUtils]: 339: Hoare triple {44703#(< 19 main_~edgecount~0)} ~i~0 := 0; {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:41,522 INFO L290 TraceCheckUtils]: 340: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:41,523 INFO L290 TraceCheckUtils]: 341: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:01:41,523 INFO L290 TraceCheckUtils]: 342: Hoare triple {45478#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:01:41,523 INFO L290 TraceCheckUtils]: 343: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:01:41,524 INFO L290 TraceCheckUtils]: 344: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:01:41,524 INFO L290 TraceCheckUtils]: 345: Hoare triple {45488#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:41,524 INFO L290 TraceCheckUtils]: 346: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:41,525 INFO L290 TraceCheckUtils]: 347: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:41,525 INFO L290 TraceCheckUtils]: 348: Hoare triple {45498#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45508#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:41,525 INFO L290 TraceCheckUtils]: 349: Hoare triple {45508#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-28 09:01:41,526 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-28 09:01:41,526 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-28 09:01:41,526 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-28 09:01:41,526 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-28 09:01:41,526 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-28 09:01:41,526 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-28 09:01:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 537 proven. 4790 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-28 09:01:41,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:42,811 INFO L290 TraceCheckUtils]: 355: Hoare triple {44427#false} assume !false; {44427#false} is VALID [2022-04-28 09:01:42,811 INFO L290 TraceCheckUtils]: 354: Hoare triple {44427#false} assume 0 == ~cond; {44427#false} is VALID [2022-04-28 09:01:42,811 INFO L290 TraceCheckUtils]: 353: Hoare triple {44427#false} ~cond := #in~cond; {44427#false} is VALID [2022-04-28 09:01:42,811 INFO L272 TraceCheckUtils]: 352: Hoare triple {44427#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {44427#false} is VALID [2022-04-28 09:01:42,811 INFO L290 TraceCheckUtils]: 351: Hoare triple {44427#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44427#false} is VALID [2022-04-28 09:01:42,811 INFO L290 TraceCheckUtils]: 350: Hoare triple {44427#false} ~i~0 := 0; {44427#false} is VALID [2022-04-28 09:01:42,812 INFO L290 TraceCheckUtils]: 349: Hoare triple {45548#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {44427#false} is VALID [2022-04-28 09:01:42,812 INFO L290 TraceCheckUtils]: 348: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45548#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,812 INFO L290 TraceCheckUtils]: 347: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,813 INFO L290 TraceCheckUtils]: 346: Hoare triple {45552#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,813 INFO L290 TraceCheckUtils]: 345: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45552#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,813 INFO L290 TraceCheckUtils]: 344: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,813 INFO L290 TraceCheckUtils]: 343: Hoare triple {45562#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,814 INFO L290 TraceCheckUtils]: 342: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {45562#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,814 INFO L290 TraceCheckUtils]: 341: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,814 INFO L290 TraceCheckUtils]: 340: Hoare triple {45572#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,815 INFO L290 TraceCheckUtils]: 339: Hoare triple {45582#(< 3 main_~edgecount~0)} ~i~0 := 0; {45572#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:42,815 INFO L290 TraceCheckUtils]: 338: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,815 INFO L290 TraceCheckUtils]: 337: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,815 INFO L290 TraceCheckUtils]: 336: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,816 INFO L290 TraceCheckUtils]: 335: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,816 INFO L290 TraceCheckUtils]: 334: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,816 INFO L290 TraceCheckUtils]: 333: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,816 INFO L290 TraceCheckUtils]: 332: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,816 INFO L290 TraceCheckUtils]: 331: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,817 INFO L290 TraceCheckUtils]: 330: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,817 INFO L290 TraceCheckUtils]: 329: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,817 INFO L290 TraceCheckUtils]: 328: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,817 INFO L290 TraceCheckUtils]: 327: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,818 INFO L290 TraceCheckUtils]: 326: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,818 INFO L290 TraceCheckUtils]: 325: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,818 INFO L290 TraceCheckUtils]: 324: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,818 INFO L290 TraceCheckUtils]: 323: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,819 INFO L290 TraceCheckUtils]: 322: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,819 INFO L290 TraceCheckUtils]: 321: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,819 INFO L290 TraceCheckUtils]: 320: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,819 INFO L290 TraceCheckUtils]: 319: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,819 INFO L290 TraceCheckUtils]: 318: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,820 INFO L290 TraceCheckUtils]: 317: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,820 INFO L290 TraceCheckUtils]: 316: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,820 INFO L290 TraceCheckUtils]: 315: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,820 INFO L290 TraceCheckUtils]: 314: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,821 INFO L290 TraceCheckUtils]: 313: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,821 INFO L290 TraceCheckUtils]: 312: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,821 INFO L290 TraceCheckUtils]: 311: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,821 INFO L290 TraceCheckUtils]: 310: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,822 INFO L290 TraceCheckUtils]: 309: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,822 INFO L290 TraceCheckUtils]: 308: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,822 INFO L290 TraceCheckUtils]: 307: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,822 INFO L290 TraceCheckUtils]: 306: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,822 INFO L290 TraceCheckUtils]: 305: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,823 INFO L290 TraceCheckUtils]: 304: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,823 INFO L290 TraceCheckUtils]: 303: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,823 INFO L290 TraceCheckUtils]: 302: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,823 INFO L290 TraceCheckUtils]: 301: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,824 INFO L290 TraceCheckUtils]: 300: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,824 INFO L290 TraceCheckUtils]: 299: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,824 INFO L290 TraceCheckUtils]: 298: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,824 INFO L290 TraceCheckUtils]: 297: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,825 INFO L290 TraceCheckUtils]: 296: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,825 INFO L290 TraceCheckUtils]: 295: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,825 INFO L290 TraceCheckUtils]: 294: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,825 INFO L290 TraceCheckUtils]: 293: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,826 INFO L290 TraceCheckUtils]: 292: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,826 INFO L290 TraceCheckUtils]: 291: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,826 INFO L290 TraceCheckUtils]: 290: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,826 INFO L290 TraceCheckUtils]: 289: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,826 INFO L290 TraceCheckUtils]: 288: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,827 INFO L290 TraceCheckUtils]: 287: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,827 INFO L290 TraceCheckUtils]: 286: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,827 INFO L290 TraceCheckUtils]: 285: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,827 INFO L290 TraceCheckUtils]: 284: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,828 INFO L290 TraceCheckUtils]: 283: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,828 INFO L290 TraceCheckUtils]: 282: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,828 INFO L290 TraceCheckUtils]: 281: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,829 INFO L290 TraceCheckUtils]: 280: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,829 INFO L290 TraceCheckUtils]: 279: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,829 INFO L290 TraceCheckUtils]: 278: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,829 INFO L290 TraceCheckUtils]: 277: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,829 INFO L290 TraceCheckUtils]: 276: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,830 INFO L290 TraceCheckUtils]: 275: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,830 INFO L290 TraceCheckUtils]: 274: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,830 INFO L290 TraceCheckUtils]: 273: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,830 INFO L290 TraceCheckUtils]: 272: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,831 INFO L290 TraceCheckUtils]: 271: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,831 INFO L290 TraceCheckUtils]: 270: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,831 INFO L290 TraceCheckUtils]: 269: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,831 INFO L290 TraceCheckUtils]: 268: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,832 INFO L290 TraceCheckUtils]: 267: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,832 INFO L290 TraceCheckUtils]: 266: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,832 INFO L290 TraceCheckUtils]: 265: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,832 INFO L290 TraceCheckUtils]: 264: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,832 INFO L290 TraceCheckUtils]: 263: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,833 INFO L290 TraceCheckUtils]: 262: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,833 INFO L290 TraceCheckUtils]: 261: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,833 INFO L290 TraceCheckUtils]: 260: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,833 INFO L290 TraceCheckUtils]: 259: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,834 INFO L290 TraceCheckUtils]: 258: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,834 INFO L290 TraceCheckUtils]: 257: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,834 INFO L290 TraceCheckUtils]: 256: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,834 INFO L290 TraceCheckUtils]: 255: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,835 INFO L290 TraceCheckUtils]: 254: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,835 INFO L290 TraceCheckUtils]: 253: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,835 INFO L290 TraceCheckUtils]: 252: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,835 INFO L290 TraceCheckUtils]: 251: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,836 INFO L290 TraceCheckUtils]: 250: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,836 INFO L290 TraceCheckUtils]: 249: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,836 INFO L290 TraceCheckUtils]: 248: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,836 INFO L290 TraceCheckUtils]: 247: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,836 INFO L290 TraceCheckUtils]: 246: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,837 INFO L290 TraceCheckUtils]: 245: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,837 INFO L290 TraceCheckUtils]: 244: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,837 INFO L290 TraceCheckUtils]: 243: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,837 INFO L290 TraceCheckUtils]: 242: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,838 INFO L290 TraceCheckUtils]: 241: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,838 INFO L290 TraceCheckUtils]: 240: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,838 INFO L290 TraceCheckUtils]: 239: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,838 INFO L290 TraceCheckUtils]: 238: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,839 INFO L290 TraceCheckUtils]: 237: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,839 INFO L290 TraceCheckUtils]: 236: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,839 INFO L290 TraceCheckUtils]: 235: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,839 INFO L290 TraceCheckUtils]: 234: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,840 INFO L290 TraceCheckUtils]: 233: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,840 INFO L290 TraceCheckUtils]: 232: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,840 INFO L290 TraceCheckUtils]: 231: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,840 INFO L290 TraceCheckUtils]: 230: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,840 INFO L290 TraceCheckUtils]: 229: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,841 INFO L290 TraceCheckUtils]: 228: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,841 INFO L290 TraceCheckUtils]: 227: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,841 INFO L290 TraceCheckUtils]: 226: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,841 INFO L290 TraceCheckUtils]: 225: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,842 INFO L290 TraceCheckUtils]: 224: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,842 INFO L290 TraceCheckUtils]: 223: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,842 INFO L290 TraceCheckUtils]: 222: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,842 INFO L290 TraceCheckUtils]: 221: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,843 INFO L290 TraceCheckUtils]: 220: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,843 INFO L290 TraceCheckUtils]: 219: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,843 INFO L290 TraceCheckUtils]: 218: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,843 INFO L290 TraceCheckUtils]: 217: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,843 INFO L290 TraceCheckUtils]: 216: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,844 INFO L290 TraceCheckUtils]: 215: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,844 INFO L290 TraceCheckUtils]: 214: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,844 INFO L290 TraceCheckUtils]: 213: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,844 INFO L290 TraceCheckUtils]: 212: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,845 INFO L290 TraceCheckUtils]: 211: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,845 INFO L290 TraceCheckUtils]: 210: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,845 INFO L290 TraceCheckUtils]: 209: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,845 INFO L290 TraceCheckUtils]: 208: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,846 INFO L290 TraceCheckUtils]: 207: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,846 INFO L290 TraceCheckUtils]: 206: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,846 INFO L290 TraceCheckUtils]: 205: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,846 INFO L290 TraceCheckUtils]: 204: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,846 INFO L290 TraceCheckUtils]: 203: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,847 INFO L290 TraceCheckUtils]: 202: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,847 INFO L290 TraceCheckUtils]: 201: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,847 INFO L290 TraceCheckUtils]: 200: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,847 INFO L290 TraceCheckUtils]: 199: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,848 INFO L290 TraceCheckUtils]: 198: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,848 INFO L290 TraceCheckUtils]: 197: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,848 INFO L290 TraceCheckUtils]: 196: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,848 INFO L290 TraceCheckUtils]: 195: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,849 INFO L290 TraceCheckUtils]: 194: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,849 INFO L290 TraceCheckUtils]: 193: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,849 INFO L290 TraceCheckUtils]: 192: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,849 INFO L290 TraceCheckUtils]: 191: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,849 INFO L290 TraceCheckUtils]: 190: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,850 INFO L290 TraceCheckUtils]: 189: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,850 INFO L290 TraceCheckUtils]: 188: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,850 INFO L290 TraceCheckUtils]: 187: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,850 INFO L290 TraceCheckUtils]: 186: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,851 INFO L290 TraceCheckUtils]: 185: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,851 INFO L290 TraceCheckUtils]: 184: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,851 INFO L290 TraceCheckUtils]: 183: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,851 INFO L290 TraceCheckUtils]: 182: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,851 INFO L290 TraceCheckUtils]: 181: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,852 INFO L290 TraceCheckUtils]: 180: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,852 INFO L290 TraceCheckUtils]: 179: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,852 INFO L290 TraceCheckUtils]: 178: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,852 INFO L290 TraceCheckUtils]: 177: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,853 INFO L290 TraceCheckUtils]: 176: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,853 INFO L290 TraceCheckUtils]: 175: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,853 INFO L290 TraceCheckUtils]: 174: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,853 INFO L290 TraceCheckUtils]: 173: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,854 INFO L290 TraceCheckUtils]: 172: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,854 INFO L290 TraceCheckUtils]: 171: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,854 INFO L290 TraceCheckUtils]: 170: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,854 INFO L290 TraceCheckUtils]: 169: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,854 INFO L290 TraceCheckUtils]: 168: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,855 INFO L290 TraceCheckUtils]: 167: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,855 INFO L290 TraceCheckUtils]: 166: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,855 INFO L290 TraceCheckUtils]: 165: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,855 INFO L290 TraceCheckUtils]: 164: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,856 INFO L290 TraceCheckUtils]: 163: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,856 INFO L290 TraceCheckUtils]: 162: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,856 INFO L290 TraceCheckUtils]: 161: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,856 INFO L290 TraceCheckUtils]: 160: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,856 INFO L290 TraceCheckUtils]: 159: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,857 INFO L290 TraceCheckUtils]: 158: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,857 INFO L290 TraceCheckUtils]: 157: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,857 INFO L290 TraceCheckUtils]: 156: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,857 INFO L290 TraceCheckUtils]: 155: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,858 INFO L290 TraceCheckUtils]: 154: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,858 INFO L290 TraceCheckUtils]: 153: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,858 INFO L290 TraceCheckUtils]: 152: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,858 INFO L290 TraceCheckUtils]: 151: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,859 INFO L290 TraceCheckUtils]: 150: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,859 INFO L290 TraceCheckUtils]: 149: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,859 INFO L290 TraceCheckUtils]: 148: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,859 INFO L290 TraceCheckUtils]: 147: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,859 INFO L290 TraceCheckUtils]: 146: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,860 INFO L290 TraceCheckUtils]: 145: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,860 INFO L290 TraceCheckUtils]: 144: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,860 INFO L290 TraceCheckUtils]: 143: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,860 INFO L290 TraceCheckUtils]: 142: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,861 INFO L290 TraceCheckUtils]: 141: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,861 INFO L290 TraceCheckUtils]: 140: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,861 INFO L290 TraceCheckUtils]: 139: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,861 INFO L290 TraceCheckUtils]: 138: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,861 INFO L290 TraceCheckUtils]: 137: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,862 INFO L290 TraceCheckUtils]: 136: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,862 INFO L290 TraceCheckUtils]: 135: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,862 INFO L290 TraceCheckUtils]: 134: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,862 INFO L290 TraceCheckUtils]: 133: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,863 INFO L290 TraceCheckUtils]: 132: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,863 INFO L290 TraceCheckUtils]: 131: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,863 INFO L290 TraceCheckUtils]: 130: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,863 INFO L290 TraceCheckUtils]: 129: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,864 INFO L290 TraceCheckUtils]: 128: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,864 INFO L290 TraceCheckUtils]: 127: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,864 INFO L290 TraceCheckUtils]: 126: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,864 INFO L290 TraceCheckUtils]: 125: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,864 INFO L290 TraceCheckUtils]: 124: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,865 INFO L290 TraceCheckUtils]: 123: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,865 INFO L290 TraceCheckUtils]: 122: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,865 INFO L290 TraceCheckUtils]: 121: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,865 INFO L290 TraceCheckUtils]: 120: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,866 INFO L290 TraceCheckUtils]: 119: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,866 INFO L290 TraceCheckUtils]: 118: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,866 INFO L290 TraceCheckUtils]: 117: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,866 INFO L290 TraceCheckUtils]: 116: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,866 INFO L290 TraceCheckUtils]: 115: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,867 INFO L290 TraceCheckUtils]: 114: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,867 INFO L290 TraceCheckUtils]: 113: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,867 INFO L290 TraceCheckUtils]: 112: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,867 INFO L290 TraceCheckUtils]: 111: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,868 INFO L290 TraceCheckUtils]: 110: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,868 INFO L290 TraceCheckUtils]: 109: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,868 INFO L290 TraceCheckUtils]: 108: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,868 INFO L290 TraceCheckUtils]: 107: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,868 INFO L290 TraceCheckUtils]: 106: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,869 INFO L290 TraceCheckUtils]: 105: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,869 INFO L290 TraceCheckUtils]: 104: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,869 INFO L290 TraceCheckUtils]: 103: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,869 INFO L290 TraceCheckUtils]: 102: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,870 INFO L290 TraceCheckUtils]: 101: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,870 INFO L290 TraceCheckUtils]: 100: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,870 INFO L290 TraceCheckUtils]: 99: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,870 INFO L290 TraceCheckUtils]: 98: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,871 INFO L290 TraceCheckUtils]: 97: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,871 INFO L290 TraceCheckUtils]: 96: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,871 INFO L290 TraceCheckUtils]: 95: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,871 INFO L290 TraceCheckUtils]: 94: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,871 INFO L290 TraceCheckUtils]: 93: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,873 INFO L290 TraceCheckUtils]: 87: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,873 INFO L290 TraceCheckUtils]: 86: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,873 INFO L290 TraceCheckUtils]: 85: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,873 INFO L290 TraceCheckUtils]: 84: Hoare triple {45582#(< 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {45582#(< 3 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {45582#(< 3 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,875 INFO L290 TraceCheckUtils]: 81: Hoare triple {44539#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {45582#(< 3 main_~edgecount~0)} is VALID [2022-04-28 09:01:42,875 INFO L290 TraceCheckUtils]: 80: Hoare triple {44529#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44539#(<= 3 main_~j~0)} is VALID [2022-04-28 09:01:42,875 INFO L290 TraceCheckUtils]: 79: Hoare triple {44529#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44529#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:42,876 INFO L290 TraceCheckUtils]: 78: Hoare triple {44529#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44529#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:42,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {44519#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44529#(<= 2 main_~j~0)} is VALID [2022-04-28 09:01:42,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {44519#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44519#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:42,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {44519#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44519#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:42,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {44509#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44519#(<= 1 main_~j~0)} is VALID [2022-04-28 09:01:42,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {44509#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {44509#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:42,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {44509#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {44509#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:42,877 INFO L290 TraceCheckUtils]: 71: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {44509#(<= 0 main_~j~0)} is VALID [2022-04-28 09:01:42,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:42,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {46387#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:42,878 INFO L290 TraceCheckUtils]: 68: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46387#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:01:42,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:42,879 INFO L290 TraceCheckUtils]: 66: Hoare triple {46397#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:42,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46397#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:01:42,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:42,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {46407#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:42,880 INFO L290 TraceCheckUtils]: 62: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46407#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:01:42,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:42,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {46417#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:42,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46417#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:01:42,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:42,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {46427#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:42,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46427#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:01:42,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:42,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {46437#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:42,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46437#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:01:42,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:42,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {46447#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:42,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46447#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:01:42,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:42,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {46457#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:42,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46457#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:01:42,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:42,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {46467#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:42,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46467#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:01:42,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:42,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {46477#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:42,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46477#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:01:42,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:42,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {46487#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:42,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46487#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:01:42,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:42,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {46497#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:42,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46497#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:01:42,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:42,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {46507#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:42,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46507#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:01:42,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:42,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {46517#(<= 0 (+ main_~j~0 14))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:42,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46517#(<= 0 (+ main_~j~0 14))} is VALID [2022-04-28 09:01:42,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:42,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {46527#(<= 0 (+ main_~j~0 15))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:42,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {46527#(<= 0 (+ main_~j~0 15))} is VALID [2022-04-28 09:01:42,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {46537#(<= 0 (+ main_~j~0 16))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {46537#(<= 0 (+ main_~j~0 16))} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {44426#true} ~i~0 := 0; {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {44426#true} assume !(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:42,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {44426#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {44426#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {44426#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {44426#true} assume !!(~i~0 < ~nodecount~0); {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {44426#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {44426#true} call #t~ret22 := main(); {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44426#true} {44426#true} #107#return; {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {44426#true} assume true; {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {44426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {44426#true} is VALID [2022-04-28 09:01:42,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {44426#true} call ULTIMATE.init(); {44426#true} is VALID [2022-04-28 09:01:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15432 backedges. 537 proven. 4790 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-28 09:01:42,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769447410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:42,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:42,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 27, 27] total 54 [2022-04-28 09:01:42,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724177962] [2022-04-28 09:01:42,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724177962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:42,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:42,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:01:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683987071] [2022-04-28 09:01:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:42,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 356 [2022-04-28 09:01:42,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:42,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:42,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:42,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:01:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:42,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:01:42,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2044, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 09:01:42,925 INFO L87 Difference]: Start difference. First operand 361 states and 470 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:44,673 INFO L93 Difference]: Finished difference Result 393 states and 507 transitions. [2022-04-28 09:01:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:01:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 356 [2022-04-28 09:01:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-28 09:01:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-04-28 09:01:44,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 120 transitions. [2022-04-28 09:01:44,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:44,764 INFO L225 Difference]: With dead ends: 393 [2022-04-28 09:01:44,764 INFO L226 Difference]: Without dead ends: 382 [2022-04-28 09:01:44,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=894, Invalid=2528, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 09:01:44,765 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 166 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:44,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 34 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-28 09:01:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2022-04-28 09:01:46,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:46,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:46,135 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:46,135 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,140 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-28 09:01:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-28 09:01:46,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 382 states. [2022-04-28 09:01:46,141 INFO L87 Difference]: Start difference. First operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 382 states. [2022-04-28 09:01:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,146 INFO L93 Difference]: Finished difference Result 382 states and 495 transitions. [2022-04-28 09:01:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 495 transitions. [2022-04-28 09:01:46,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:46,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 358 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-04-28 09:01:46,152 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 356 [2022-04-28 09:01:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:46,152 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-04-28 09:01:46,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:46,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 473 transitions. [2022-04-28 09:01:46,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-04-28 09:01:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-04-28 09:01:46,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:46,887 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 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] [2022-04-28 09:01:46,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-28 09:01:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 09:01:47,087 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 59 times [2022-04-28 09:01:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:47,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762771225] [2022-04-28 09:01:47,091 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:47,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1962575558, now seen corresponding path program 60 times [2022-04-28 09:01:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:47,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086902175] [2022-04-28 09:01:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:47,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-28 09:01:47,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-28 09:01:47,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-28 09:01:47,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:47,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {48917#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-28 09:01:47,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-28 09:01:47,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-28 09:01:47,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-28 09:01:47,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,381 INFO L290 TraceCheckUtils]: 53: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,385 INFO L290 TraceCheckUtils]: 73: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,386 INFO L290 TraceCheckUtils]: 75: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,386 INFO L290 TraceCheckUtils]: 76: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,386 INFO L290 TraceCheckUtils]: 77: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,386 INFO L290 TraceCheckUtils]: 78: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,388 INFO L290 TraceCheckUtils]: 83: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,389 INFO L290 TraceCheckUtils]: 88: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,389 INFO L290 TraceCheckUtils]: 90: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,389 INFO L290 TraceCheckUtils]: 91: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,389 INFO L290 TraceCheckUtils]: 92: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,390 INFO L290 TraceCheckUtils]: 93: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,390 INFO L290 TraceCheckUtils]: 94: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,390 INFO L290 TraceCheckUtils]: 95: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,391 INFO L290 TraceCheckUtils]: 97: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,391 INFO L290 TraceCheckUtils]: 98: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,391 INFO L290 TraceCheckUtils]: 99: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,391 INFO L290 TraceCheckUtils]: 100: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,391 INFO L290 TraceCheckUtils]: 101: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,392 INFO L290 TraceCheckUtils]: 102: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,392 INFO L290 TraceCheckUtils]: 103: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,392 INFO L290 TraceCheckUtils]: 104: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,392 INFO L290 TraceCheckUtils]: 105: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,392 INFO L290 TraceCheckUtils]: 106: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,393 INFO L290 TraceCheckUtils]: 107: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,393 INFO L290 TraceCheckUtils]: 108: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,393 INFO L290 TraceCheckUtils]: 109: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,393 INFO L290 TraceCheckUtils]: 110: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,394 INFO L290 TraceCheckUtils]: 111: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,394 INFO L290 TraceCheckUtils]: 112: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,394 INFO L290 TraceCheckUtils]: 113: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,394 INFO L290 TraceCheckUtils]: 114: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,394 INFO L290 TraceCheckUtils]: 115: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,395 INFO L290 TraceCheckUtils]: 116: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,395 INFO L290 TraceCheckUtils]: 117: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,395 INFO L290 TraceCheckUtils]: 118: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,395 INFO L290 TraceCheckUtils]: 119: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,396 INFO L290 TraceCheckUtils]: 120: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,396 INFO L290 TraceCheckUtils]: 121: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,396 INFO L290 TraceCheckUtils]: 122: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,396 INFO L290 TraceCheckUtils]: 123: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,396 INFO L290 TraceCheckUtils]: 124: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,397 INFO L290 TraceCheckUtils]: 125: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,397 INFO L290 TraceCheckUtils]: 126: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,397 INFO L290 TraceCheckUtils]: 127: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,397 INFO L290 TraceCheckUtils]: 128: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,397 INFO L290 TraceCheckUtils]: 129: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,398 INFO L290 TraceCheckUtils]: 130: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,398 INFO L290 TraceCheckUtils]: 131: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,398 INFO L290 TraceCheckUtils]: 132: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,398 INFO L290 TraceCheckUtils]: 133: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,398 INFO L290 TraceCheckUtils]: 134: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,399 INFO L290 TraceCheckUtils]: 135: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,399 INFO L290 TraceCheckUtils]: 136: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,399 INFO L290 TraceCheckUtils]: 137: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,399 INFO L290 TraceCheckUtils]: 138: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,400 INFO L290 TraceCheckUtils]: 139: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,400 INFO L290 TraceCheckUtils]: 140: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,400 INFO L290 TraceCheckUtils]: 141: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,400 INFO L290 TraceCheckUtils]: 142: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,400 INFO L290 TraceCheckUtils]: 143: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,401 INFO L290 TraceCheckUtils]: 144: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,401 INFO L290 TraceCheckUtils]: 145: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,401 INFO L290 TraceCheckUtils]: 146: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,401 INFO L290 TraceCheckUtils]: 147: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,401 INFO L290 TraceCheckUtils]: 148: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,402 INFO L290 TraceCheckUtils]: 149: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,402 INFO L290 TraceCheckUtils]: 150: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,402 INFO L290 TraceCheckUtils]: 151: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,402 INFO L290 TraceCheckUtils]: 152: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,402 INFO L290 TraceCheckUtils]: 153: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,403 INFO L290 TraceCheckUtils]: 154: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,403 INFO L290 TraceCheckUtils]: 155: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,403 INFO L290 TraceCheckUtils]: 156: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,403 INFO L290 TraceCheckUtils]: 157: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,404 INFO L290 TraceCheckUtils]: 158: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,404 INFO L290 TraceCheckUtils]: 159: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,404 INFO L290 TraceCheckUtils]: 160: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,404 INFO L290 TraceCheckUtils]: 161: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,404 INFO L290 TraceCheckUtils]: 162: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,405 INFO L290 TraceCheckUtils]: 163: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,405 INFO L290 TraceCheckUtils]: 164: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,405 INFO L290 TraceCheckUtils]: 165: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,405 INFO L290 TraceCheckUtils]: 166: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,405 INFO L290 TraceCheckUtils]: 167: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,406 INFO L290 TraceCheckUtils]: 168: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,406 INFO L290 TraceCheckUtils]: 169: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,406 INFO L290 TraceCheckUtils]: 170: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,406 INFO L290 TraceCheckUtils]: 171: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,407 INFO L290 TraceCheckUtils]: 172: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,407 INFO L290 TraceCheckUtils]: 173: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,407 INFO L290 TraceCheckUtils]: 174: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,407 INFO L290 TraceCheckUtils]: 175: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,407 INFO L290 TraceCheckUtils]: 176: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,408 INFO L290 TraceCheckUtils]: 177: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,408 INFO L290 TraceCheckUtils]: 178: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,408 INFO L290 TraceCheckUtils]: 179: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,408 INFO L290 TraceCheckUtils]: 180: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,408 INFO L290 TraceCheckUtils]: 181: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,409 INFO L290 TraceCheckUtils]: 182: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,409 INFO L290 TraceCheckUtils]: 183: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,409 INFO L290 TraceCheckUtils]: 184: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,409 INFO L290 TraceCheckUtils]: 185: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,410 INFO L290 TraceCheckUtils]: 186: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,410 INFO L290 TraceCheckUtils]: 187: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,410 INFO L290 TraceCheckUtils]: 188: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,410 INFO L290 TraceCheckUtils]: 189: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,410 INFO L290 TraceCheckUtils]: 190: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,411 INFO L290 TraceCheckUtils]: 191: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,411 INFO L290 TraceCheckUtils]: 192: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,411 INFO L290 TraceCheckUtils]: 193: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,411 INFO L290 TraceCheckUtils]: 194: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,412 INFO L290 TraceCheckUtils]: 195: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,412 INFO L290 TraceCheckUtils]: 196: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,412 INFO L290 TraceCheckUtils]: 197: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,412 INFO L290 TraceCheckUtils]: 198: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,412 INFO L290 TraceCheckUtils]: 199: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,413 INFO L290 TraceCheckUtils]: 200: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,413 INFO L290 TraceCheckUtils]: 201: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,413 INFO L290 TraceCheckUtils]: 202: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,413 INFO L290 TraceCheckUtils]: 203: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,413 INFO L290 TraceCheckUtils]: 204: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,414 INFO L290 TraceCheckUtils]: 205: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,414 INFO L290 TraceCheckUtils]: 206: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,414 INFO L290 TraceCheckUtils]: 207: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,414 INFO L290 TraceCheckUtils]: 208: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,414 INFO L290 TraceCheckUtils]: 209: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,415 INFO L290 TraceCheckUtils]: 210: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,415 INFO L290 TraceCheckUtils]: 211: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,415 INFO L290 TraceCheckUtils]: 212: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,415 INFO L290 TraceCheckUtils]: 213: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,416 INFO L290 TraceCheckUtils]: 214: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,416 INFO L290 TraceCheckUtils]: 215: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,416 INFO L290 TraceCheckUtils]: 216: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,416 INFO L290 TraceCheckUtils]: 217: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,416 INFO L290 TraceCheckUtils]: 218: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,417 INFO L290 TraceCheckUtils]: 219: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,417 INFO L290 TraceCheckUtils]: 220: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,417 INFO L290 TraceCheckUtils]: 221: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,417 INFO L290 TraceCheckUtils]: 222: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,417 INFO L290 TraceCheckUtils]: 223: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,418 INFO L290 TraceCheckUtils]: 224: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,418 INFO L290 TraceCheckUtils]: 225: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,418 INFO L290 TraceCheckUtils]: 226: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,418 INFO L290 TraceCheckUtils]: 227: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,419 INFO L290 TraceCheckUtils]: 228: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,419 INFO L290 TraceCheckUtils]: 229: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,419 INFO L290 TraceCheckUtils]: 230: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,419 INFO L290 TraceCheckUtils]: 231: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,419 INFO L290 TraceCheckUtils]: 232: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,420 INFO L290 TraceCheckUtils]: 233: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,420 INFO L290 TraceCheckUtils]: 234: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,420 INFO L290 TraceCheckUtils]: 235: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,420 INFO L290 TraceCheckUtils]: 236: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,420 INFO L290 TraceCheckUtils]: 237: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,421 INFO L290 TraceCheckUtils]: 238: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,421 INFO L290 TraceCheckUtils]: 239: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,421 INFO L290 TraceCheckUtils]: 240: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,421 INFO L290 TraceCheckUtils]: 241: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,422 INFO L290 TraceCheckUtils]: 242: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,422 INFO L290 TraceCheckUtils]: 243: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,422 INFO L290 TraceCheckUtils]: 244: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,422 INFO L290 TraceCheckUtils]: 245: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,422 INFO L290 TraceCheckUtils]: 246: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,423 INFO L290 TraceCheckUtils]: 247: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,423 INFO L290 TraceCheckUtils]: 248: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,423 INFO L290 TraceCheckUtils]: 249: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,423 INFO L290 TraceCheckUtils]: 250: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,423 INFO L290 TraceCheckUtils]: 251: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,424 INFO L290 TraceCheckUtils]: 252: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,424 INFO L290 TraceCheckUtils]: 253: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,424 INFO L290 TraceCheckUtils]: 254: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,424 INFO L290 TraceCheckUtils]: 255: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,425 INFO L290 TraceCheckUtils]: 256: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,425 INFO L290 TraceCheckUtils]: 257: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,425 INFO L290 TraceCheckUtils]: 258: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,425 INFO L290 TraceCheckUtils]: 259: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,425 INFO L290 TraceCheckUtils]: 260: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,426 INFO L290 TraceCheckUtils]: 261: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,426 INFO L290 TraceCheckUtils]: 262: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,426 INFO L290 TraceCheckUtils]: 263: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,426 INFO L290 TraceCheckUtils]: 264: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,426 INFO L290 TraceCheckUtils]: 265: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,427 INFO L290 TraceCheckUtils]: 266: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,427 INFO L290 TraceCheckUtils]: 267: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,427 INFO L290 TraceCheckUtils]: 268: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,427 INFO L290 TraceCheckUtils]: 269: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,428 INFO L290 TraceCheckUtils]: 270: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,428 INFO L290 TraceCheckUtils]: 271: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,428 INFO L290 TraceCheckUtils]: 272: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,428 INFO L290 TraceCheckUtils]: 273: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,428 INFO L290 TraceCheckUtils]: 274: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,429 INFO L290 TraceCheckUtils]: 275: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,429 INFO L290 TraceCheckUtils]: 276: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,429 INFO L290 TraceCheckUtils]: 277: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,429 INFO L290 TraceCheckUtils]: 278: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,429 INFO L290 TraceCheckUtils]: 279: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,430 INFO L290 TraceCheckUtils]: 280: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,430 INFO L290 TraceCheckUtils]: 281: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,430 INFO L290 TraceCheckUtils]: 282: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,430 INFO L290 TraceCheckUtils]: 283: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,430 INFO L290 TraceCheckUtils]: 284: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,431 INFO L290 TraceCheckUtils]: 285: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,431 INFO L290 TraceCheckUtils]: 286: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,431 INFO L290 TraceCheckUtils]: 287: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,431 INFO L290 TraceCheckUtils]: 288: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,432 INFO L290 TraceCheckUtils]: 289: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,432 INFO L290 TraceCheckUtils]: 290: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,432 INFO L290 TraceCheckUtils]: 291: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,432 INFO L290 TraceCheckUtils]: 292: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,432 INFO L290 TraceCheckUtils]: 293: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,433 INFO L290 TraceCheckUtils]: 294: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,433 INFO L290 TraceCheckUtils]: 295: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,433 INFO L290 TraceCheckUtils]: 296: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,433 INFO L290 TraceCheckUtils]: 297: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,434 INFO L290 TraceCheckUtils]: 298: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,434 INFO L290 TraceCheckUtils]: 299: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,434 INFO L290 TraceCheckUtils]: 300: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,434 INFO L290 TraceCheckUtils]: 301: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,434 INFO L290 TraceCheckUtils]: 302: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,435 INFO L290 TraceCheckUtils]: 303: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,435 INFO L290 TraceCheckUtils]: 304: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,435 INFO L290 TraceCheckUtils]: 305: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,435 INFO L290 TraceCheckUtils]: 306: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,435 INFO L290 TraceCheckUtils]: 307: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,436 INFO L290 TraceCheckUtils]: 308: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,436 INFO L290 TraceCheckUtils]: 309: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,436 INFO L290 TraceCheckUtils]: 310: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,436 INFO L290 TraceCheckUtils]: 311: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,437 INFO L290 TraceCheckUtils]: 312: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,437 INFO L290 TraceCheckUtils]: 313: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,437 INFO L290 TraceCheckUtils]: 314: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,437 INFO L290 TraceCheckUtils]: 315: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,437 INFO L290 TraceCheckUtils]: 316: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,438 INFO L290 TraceCheckUtils]: 317: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,438 INFO L290 TraceCheckUtils]: 318: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,438 INFO L290 TraceCheckUtils]: 319: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,438 INFO L290 TraceCheckUtils]: 320: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,438 INFO L290 TraceCheckUtils]: 321: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,439 INFO L290 TraceCheckUtils]: 322: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,439 INFO L290 TraceCheckUtils]: 323: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,439 INFO L290 TraceCheckUtils]: 324: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,439 INFO L290 TraceCheckUtils]: 325: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,440 INFO L290 TraceCheckUtils]: 326: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,440 INFO L290 TraceCheckUtils]: 327: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,440 INFO L290 TraceCheckUtils]: 328: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,440 INFO L290 TraceCheckUtils]: 329: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,440 INFO L290 TraceCheckUtils]: 330: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,441 INFO L290 TraceCheckUtils]: 331: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,441 INFO L290 TraceCheckUtils]: 332: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,441 INFO L290 TraceCheckUtils]: 333: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,441 INFO L290 TraceCheckUtils]: 334: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,441 INFO L290 TraceCheckUtils]: 335: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,442 INFO L290 TraceCheckUtils]: 336: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,442 INFO L290 TraceCheckUtils]: 337: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,442 INFO L290 TraceCheckUtils]: 338: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:47,442 INFO L290 TraceCheckUtils]: 339: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:47,443 INFO L290 TraceCheckUtils]: 340: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:47,443 INFO L290 TraceCheckUtils]: 341: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:47,443 INFO L290 TraceCheckUtils]: 342: Hoare triple {48912#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,444 INFO L290 TraceCheckUtils]: 343: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,444 INFO L290 TraceCheckUtils]: 344: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,445 INFO L290 TraceCheckUtils]: 345: Hoare triple {48913#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,445 INFO L290 TraceCheckUtils]: 346: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,445 INFO L290 TraceCheckUtils]: 347: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,445 INFO L290 TraceCheckUtils]: 348: Hoare triple {48914#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,446 INFO L290 TraceCheckUtils]: 349: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,446 INFO L290 TraceCheckUtils]: 350: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,446 INFO L290 TraceCheckUtils]: 351: Hoare triple {48915#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {48916#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:01:47,446 INFO L290 TraceCheckUtils]: 352: Hoare triple {48916#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-28 09:01:47,446 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-28 09:01:47,447 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-28 09:01:47,447 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-28 09:01:47,447 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-28 09:01:47,447 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-28 09:01:47,447 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-28 09:01:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:47,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086902175] [2022-04-28 09:01:47,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086902175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926879342] [2022-04-28 09:01:47,448 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:01:47,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:47,449 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:47,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 09:01:48,999 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 09:01:48,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:49,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:01:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:49,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:50,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-28 09:01:50,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-28 09:01:50,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-28 09:01:50,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-28 09:01:50,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-28 09:01:50,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,142 INFO L290 TraceCheckUtils]: 58: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,142 INFO L290 TraceCheckUtils]: 59: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,142 INFO L290 TraceCheckUtils]: 60: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,143 INFO L290 TraceCheckUtils]: 63: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,143 INFO L290 TraceCheckUtils]: 64: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,144 INFO L290 TraceCheckUtils]: 67: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,144 INFO L290 TraceCheckUtils]: 68: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,144 INFO L290 TraceCheckUtils]: 69: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,144 INFO L290 TraceCheckUtils]: 70: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,146 INFO L290 TraceCheckUtils]: 75: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,146 INFO L290 TraceCheckUtils]: 77: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,146 INFO L290 TraceCheckUtils]: 78: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,146 INFO L290 TraceCheckUtils]: 79: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,147 INFO L290 TraceCheckUtils]: 82: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,147 INFO L290 TraceCheckUtils]: 83: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,148 INFO L290 TraceCheckUtils]: 84: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,148 INFO L290 TraceCheckUtils]: 85: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,148 INFO L290 TraceCheckUtils]: 86: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,148 INFO L290 TraceCheckUtils]: 87: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,148 INFO L290 TraceCheckUtils]: 88: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,149 INFO L290 TraceCheckUtils]: 89: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,149 INFO L290 TraceCheckUtils]: 90: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,149 INFO L290 TraceCheckUtils]: 91: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,149 INFO L290 TraceCheckUtils]: 92: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,150 INFO L290 TraceCheckUtils]: 93: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,150 INFO L290 TraceCheckUtils]: 94: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,150 INFO L290 TraceCheckUtils]: 95: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,150 INFO L290 TraceCheckUtils]: 96: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,151 INFO L290 TraceCheckUtils]: 97: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,151 INFO L290 TraceCheckUtils]: 98: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,151 INFO L290 TraceCheckUtils]: 99: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,151 INFO L290 TraceCheckUtils]: 100: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,151 INFO L290 TraceCheckUtils]: 101: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,152 INFO L290 TraceCheckUtils]: 102: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,152 INFO L290 TraceCheckUtils]: 103: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,152 INFO L290 TraceCheckUtils]: 104: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,152 INFO L290 TraceCheckUtils]: 105: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,153 INFO L290 TraceCheckUtils]: 106: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,153 INFO L290 TraceCheckUtils]: 107: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,153 INFO L290 TraceCheckUtils]: 108: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,153 INFO L290 TraceCheckUtils]: 109: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,154 INFO L290 TraceCheckUtils]: 110: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,154 INFO L290 TraceCheckUtils]: 111: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,154 INFO L290 TraceCheckUtils]: 112: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,154 INFO L290 TraceCheckUtils]: 113: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,154 INFO L290 TraceCheckUtils]: 114: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,155 INFO L290 TraceCheckUtils]: 115: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,155 INFO L290 TraceCheckUtils]: 116: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,155 INFO L290 TraceCheckUtils]: 117: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,155 INFO L290 TraceCheckUtils]: 118: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,156 INFO L290 TraceCheckUtils]: 119: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,156 INFO L290 TraceCheckUtils]: 120: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,156 INFO L290 TraceCheckUtils]: 121: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,156 INFO L290 TraceCheckUtils]: 122: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,156 INFO L290 TraceCheckUtils]: 123: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,157 INFO L290 TraceCheckUtils]: 124: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,157 INFO L290 TraceCheckUtils]: 125: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,157 INFO L290 TraceCheckUtils]: 126: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,157 INFO L290 TraceCheckUtils]: 127: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,158 INFO L290 TraceCheckUtils]: 128: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,158 INFO L290 TraceCheckUtils]: 129: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,158 INFO L290 TraceCheckUtils]: 130: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,158 INFO L290 TraceCheckUtils]: 131: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,159 INFO L290 TraceCheckUtils]: 132: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,159 INFO L290 TraceCheckUtils]: 133: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,159 INFO L290 TraceCheckUtils]: 134: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,159 INFO L290 TraceCheckUtils]: 135: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,159 INFO L290 TraceCheckUtils]: 136: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,160 INFO L290 TraceCheckUtils]: 137: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,160 INFO L290 TraceCheckUtils]: 138: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,160 INFO L290 TraceCheckUtils]: 139: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,160 INFO L290 TraceCheckUtils]: 140: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,161 INFO L290 TraceCheckUtils]: 141: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,161 INFO L290 TraceCheckUtils]: 142: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,161 INFO L290 TraceCheckUtils]: 143: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,161 INFO L290 TraceCheckUtils]: 144: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,162 INFO L290 TraceCheckUtils]: 145: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,162 INFO L290 TraceCheckUtils]: 146: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,162 INFO L290 TraceCheckUtils]: 147: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,162 INFO L290 TraceCheckUtils]: 148: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,162 INFO L290 TraceCheckUtils]: 149: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,163 INFO L290 TraceCheckUtils]: 150: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,163 INFO L290 TraceCheckUtils]: 151: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,163 INFO L290 TraceCheckUtils]: 152: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,163 INFO L290 TraceCheckUtils]: 153: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,164 INFO L290 TraceCheckUtils]: 154: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,164 INFO L290 TraceCheckUtils]: 155: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,164 INFO L290 TraceCheckUtils]: 156: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,164 INFO L290 TraceCheckUtils]: 157: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,165 INFO L290 TraceCheckUtils]: 158: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,165 INFO L290 TraceCheckUtils]: 159: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,165 INFO L290 TraceCheckUtils]: 160: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,165 INFO L290 TraceCheckUtils]: 161: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,165 INFO L290 TraceCheckUtils]: 162: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,166 INFO L290 TraceCheckUtils]: 163: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,166 INFO L290 TraceCheckUtils]: 164: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,166 INFO L290 TraceCheckUtils]: 165: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,166 INFO L290 TraceCheckUtils]: 166: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,167 INFO L290 TraceCheckUtils]: 167: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,167 INFO L290 TraceCheckUtils]: 168: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,167 INFO L290 TraceCheckUtils]: 169: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,167 INFO L290 TraceCheckUtils]: 170: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,168 INFO L290 TraceCheckUtils]: 171: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,168 INFO L290 TraceCheckUtils]: 172: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,168 INFO L290 TraceCheckUtils]: 173: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,168 INFO L290 TraceCheckUtils]: 174: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,168 INFO L290 TraceCheckUtils]: 175: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,169 INFO L290 TraceCheckUtils]: 176: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,169 INFO L290 TraceCheckUtils]: 177: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,169 INFO L290 TraceCheckUtils]: 178: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,169 INFO L290 TraceCheckUtils]: 179: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,170 INFO L290 TraceCheckUtils]: 180: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,170 INFO L290 TraceCheckUtils]: 181: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,170 INFO L290 TraceCheckUtils]: 182: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,170 INFO L290 TraceCheckUtils]: 183: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,171 INFO L290 TraceCheckUtils]: 184: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,171 INFO L290 TraceCheckUtils]: 185: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,171 INFO L290 TraceCheckUtils]: 186: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,171 INFO L290 TraceCheckUtils]: 187: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,171 INFO L290 TraceCheckUtils]: 188: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,172 INFO L290 TraceCheckUtils]: 189: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,172 INFO L290 TraceCheckUtils]: 190: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,172 INFO L290 TraceCheckUtils]: 191: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,172 INFO L290 TraceCheckUtils]: 192: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,173 INFO L290 TraceCheckUtils]: 193: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,173 INFO L290 TraceCheckUtils]: 194: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,173 INFO L290 TraceCheckUtils]: 195: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,173 INFO L290 TraceCheckUtils]: 196: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,173 INFO L290 TraceCheckUtils]: 197: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,174 INFO L290 TraceCheckUtils]: 198: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,174 INFO L290 TraceCheckUtils]: 199: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,174 INFO L290 TraceCheckUtils]: 200: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,174 INFO L290 TraceCheckUtils]: 201: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,175 INFO L290 TraceCheckUtils]: 202: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,175 INFO L290 TraceCheckUtils]: 203: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,175 INFO L290 TraceCheckUtils]: 204: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,175 INFO L290 TraceCheckUtils]: 205: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,176 INFO L290 TraceCheckUtils]: 206: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,176 INFO L290 TraceCheckUtils]: 207: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,176 INFO L290 TraceCheckUtils]: 208: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,176 INFO L290 TraceCheckUtils]: 209: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,176 INFO L290 TraceCheckUtils]: 210: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,177 INFO L290 TraceCheckUtils]: 211: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,177 INFO L290 TraceCheckUtils]: 212: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,177 INFO L290 TraceCheckUtils]: 213: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,177 INFO L290 TraceCheckUtils]: 214: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,178 INFO L290 TraceCheckUtils]: 215: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,178 INFO L290 TraceCheckUtils]: 216: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,178 INFO L290 TraceCheckUtils]: 217: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,178 INFO L290 TraceCheckUtils]: 218: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,179 INFO L290 TraceCheckUtils]: 219: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,179 INFO L290 TraceCheckUtils]: 220: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,179 INFO L290 TraceCheckUtils]: 221: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,179 INFO L290 TraceCheckUtils]: 222: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,179 INFO L290 TraceCheckUtils]: 223: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,180 INFO L290 TraceCheckUtils]: 224: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,180 INFO L290 TraceCheckUtils]: 225: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,180 INFO L290 TraceCheckUtils]: 226: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,180 INFO L290 TraceCheckUtils]: 227: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,181 INFO L290 TraceCheckUtils]: 228: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,181 INFO L290 TraceCheckUtils]: 229: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,181 INFO L290 TraceCheckUtils]: 230: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,181 INFO L290 TraceCheckUtils]: 231: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,181 INFO L290 TraceCheckUtils]: 232: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,182 INFO L290 TraceCheckUtils]: 233: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,182 INFO L290 TraceCheckUtils]: 234: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,182 INFO L290 TraceCheckUtils]: 235: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,182 INFO L290 TraceCheckUtils]: 236: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,183 INFO L290 TraceCheckUtils]: 237: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,183 INFO L290 TraceCheckUtils]: 238: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,183 INFO L290 TraceCheckUtils]: 239: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,183 INFO L290 TraceCheckUtils]: 240: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,183 INFO L290 TraceCheckUtils]: 241: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,184 INFO L290 TraceCheckUtils]: 242: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,184 INFO L290 TraceCheckUtils]: 243: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,184 INFO L290 TraceCheckUtils]: 244: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,184 INFO L290 TraceCheckUtils]: 245: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,185 INFO L290 TraceCheckUtils]: 246: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,185 INFO L290 TraceCheckUtils]: 247: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,185 INFO L290 TraceCheckUtils]: 248: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,185 INFO L290 TraceCheckUtils]: 249: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,186 INFO L290 TraceCheckUtils]: 250: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,186 INFO L290 TraceCheckUtils]: 251: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,186 INFO L290 TraceCheckUtils]: 252: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,186 INFO L290 TraceCheckUtils]: 253: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,186 INFO L290 TraceCheckUtils]: 254: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,187 INFO L290 TraceCheckUtils]: 255: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,187 INFO L290 TraceCheckUtils]: 256: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,187 INFO L290 TraceCheckUtils]: 257: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,187 INFO L290 TraceCheckUtils]: 258: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,188 INFO L290 TraceCheckUtils]: 259: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,188 INFO L290 TraceCheckUtils]: 260: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,188 INFO L290 TraceCheckUtils]: 261: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,188 INFO L290 TraceCheckUtils]: 262: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,188 INFO L290 TraceCheckUtils]: 263: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,189 INFO L290 TraceCheckUtils]: 264: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,189 INFO L290 TraceCheckUtils]: 265: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,189 INFO L290 TraceCheckUtils]: 266: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,189 INFO L290 TraceCheckUtils]: 267: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,190 INFO L290 TraceCheckUtils]: 268: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,190 INFO L290 TraceCheckUtils]: 269: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,190 INFO L290 TraceCheckUtils]: 270: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,190 INFO L290 TraceCheckUtils]: 271: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,191 INFO L290 TraceCheckUtils]: 272: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,191 INFO L290 TraceCheckUtils]: 273: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,191 INFO L290 TraceCheckUtils]: 274: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,191 INFO L290 TraceCheckUtils]: 275: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,191 INFO L290 TraceCheckUtils]: 276: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,192 INFO L290 TraceCheckUtils]: 277: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,192 INFO L290 TraceCheckUtils]: 278: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,192 INFO L290 TraceCheckUtils]: 279: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,192 INFO L290 TraceCheckUtils]: 280: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,193 INFO L290 TraceCheckUtils]: 281: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,193 INFO L290 TraceCheckUtils]: 282: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,193 INFO L290 TraceCheckUtils]: 283: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,193 INFO L290 TraceCheckUtils]: 284: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,194 INFO L290 TraceCheckUtils]: 285: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,194 INFO L290 TraceCheckUtils]: 286: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,194 INFO L290 TraceCheckUtils]: 287: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,194 INFO L290 TraceCheckUtils]: 288: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,194 INFO L290 TraceCheckUtils]: 289: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,195 INFO L290 TraceCheckUtils]: 290: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,195 INFO L290 TraceCheckUtils]: 291: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,195 INFO L290 TraceCheckUtils]: 292: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,195 INFO L290 TraceCheckUtils]: 293: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,196 INFO L290 TraceCheckUtils]: 294: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,196 INFO L290 TraceCheckUtils]: 295: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,196 INFO L290 TraceCheckUtils]: 296: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,196 INFO L290 TraceCheckUtils]: 297: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,196 INFO L290 TraceCheckUtils]: 298: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,197 INFO L290 TraceCheckUtils]: 299: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,197 INFO L290 TraceCheckUtils]: 300: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,197 INFO L290 TraceCheckUtils]: 301: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,197 INFO L290 TraceCheckUtils]: 302: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,198 INFO L290 TraceCheckUtils]: 303: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,198 INFO L290 TraceCheckUtils]: 304: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,198 INFO L290 TraceCheckUtils]: 305: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,198 INFO L290 TraceCheckUtils]: 306: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,199 INFO L290 TraceCheckUtils]: 307: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,199 INFO L290 TraceCheckUtils]: 308: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,199 INFO L290 TraceCheckUtils]: 309: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,199 INFO L290 TraceCheckUtils]: 310: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,199 INFO L290 TraceCheckUtils]: 311: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,200 INFO L290 TraceCheckUtils]: 312: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,200 INFO L290 TraceCheckUtils]: 313: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,200 INFO L290 TraceCheckUtils]: 314: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,200 INFO L290 TraceCheckUtils]: 315: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,201 INFO L290 TraceCheckUtils]: 316: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,201 INFO L290 TraceCheckUtils]: 317: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,201 INFO L290 TraceCheckUtils]: 318: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,201 INFO L290 TraceCheckUtils]: 319: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,202 INFO L290 TraceCheckUtils]: 320: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,202 INFO L290 TraceCheckUtils]: 321: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,202 INFO L290 TraceCheckUtils]: 322: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,202 INFO L290 TraceCheckUtils]: 323: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,202 INFO L290 TraceCheckUtils]: 324: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,203 INFO L290 TraceCheckUtils]: 325: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,203 INFO L290 TraceCheckUtils]: 326: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,203 INFO L290 TraceCheckUtils]: 327: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,203 INFO L290 TraceCheckUtils]: 328: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,204 INFO L290 TraceCheckUtils]: 329: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,204 INFO L290 TraceCheckUtils]: 330: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,204 INFO L290 TraceCheckUtils]: 331: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,204 INFO L290 TraceCheckUtils]: 332: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,204 INFO L290 TraceCheckUtils]: 333: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,205 INFO L290 TraceCheckUtils]: 334: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,205 INFO L290 TraceCheckUtils]: 335: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,205 INFO L290 TraceCheckUtils]: 336: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,205 INFO L290 TraceCheckUtils]: 337: Hoare triple {48911#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,206 INFO L290 TraceCheckUtils]: 338: Hoare triple {48911#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {48911#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:50,206 INFO L290 TraceCheckUtils]: 339: Hoare triple {48911#(<= 20 main_~edgecount~0)} ~i~0 := 0; {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:50,206 INFO L290 TraceCheckUtils]: 340: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:50,207 INFO L290 TraceCheckUtils]: 341: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:50,207 INFO L290 TraceCheckUtils]: 342: Hoare triple {49938#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:50,207 INFO L290 TraceCheckUtils]: 343: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:50,208 INFO L290 TraceCheckUtils]: 344: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:50,208 INFO L290 TraceCheckUtils]: 345: Hoare triple {49948#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:50,209 INFO L290 TraceCheckUtils]: 346: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:50,209 INFO L290 TraceCheckUtils]: 347: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:50,209 INFO L290 TraceCheckUtils]: 348: Hoare triple {49958#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:50,210 INFO L290 TraceCheckUtils]: 349: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:50,210 INFO L290 TraceCheckUtils]: 350: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:50,210 INFO L290 TraceCheckUtils]: 351: Hoare triple {49968#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {49978#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-28 09:01:50,211 INFO L290 TraceCheckUtils]: 352: Hoare triple {49978#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-28 09:01:50,211 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-28 09:01:50,211 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-28 09:01:50,211 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-28 09:01:50,211 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-28 09:01:50,211 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-28 09:01:50,211 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-28 09:01:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:50,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:51,271 INFO L290 TraceCheckUtils]: 358: Hoare triple {48907#false} assume !false; {48907#false} is VALID [2022-04-28 09:01:51,271 INFO L290 TraceCheckUtils]: 357: Hoare triple {48907#false} assume 0 == ~cond; {48907#false} is VALID [2022-04-28 09:01:51,271 INFO L290 TraceCheckUtils]: 356: Hoare triple {48907#false} ~cond := #in~cond; {48907#false} is VALID [2022-04-28 09:01:51,271 INFO L272 TraceCheckUtils]: 355: Hoare triple {48907#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {48907#false} is VALID [2022-04-28 09:01:51,271 INFO L290 TraceCheckUtils]: 354: Hoare triple {48907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {48907#false} is VALID [2022-04-28 09:01:51,271 INFO L290 TraceCheckUtils]: 353: Hoare triple {48907#false} ~i~0 := 0; {48907#false} is VALID [2022-04-28 09:01:51,271 INFO L290 TraceCheckUtils]: 352: Hoare triple {50018#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {48907#false} is VALID [2022-04-28 09:01:51,272 INFO L290 TraceCheckUtils]: 351: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50018#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,272 INFO L290 TraceCheckUtils]: 350: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,272 INFO L290 TraceCheckUtils]: 349: Hoare triple {50022#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,272 INFO L290 TraceCheckUtils]: 348: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50022#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,273 INFO L290 TraceCheckUtils]: 347: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,273 INFO L290 TraceCheckUtils]: 346: Hoare triple {50032#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,273 INFO L290 TraceCheckUtils]: 345: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50032#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,274 INFO L290 TraceCheckUtils]: 344: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,274 INFO L290 TraceCheckUtils]: 343: Hoare triple {50042#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,274 INFO L290 TraceCheckUtils]: 342: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {50042#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,274 INFO L290 TraceCheckUtils]: 341: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,275 INFO L290 TraceCheckUtils]: 340: Hoare triple {50052#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,275 INFO L290 TraceCheckUtils]: 339: Hoare triple {50062#(< 4 main_~edgecount~0)} ~i~0 := 0; {50052#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:51,275 INFO L290 TraceCheckUtils]: 338: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,275 INFO L290 TraceCheckUtils]: 337: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,276 INFO L290 TraceCheckUtils]: 336: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,276 INFO L290 TraceCheckUtils]: 335: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,276 INFO L290 TraceCheckUtils]: 334: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,276 INFO L290 TraceCheckUtils]: 333: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,276 INFO L290 TraceCheckUtils]: 332: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,277 INFO L290 TraceCheckUtils]: 331: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,277 INFO L290 TraceCheckUtils]: 330: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,277 INFO L290 TraceCheckUtils]: 329: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,277 INFO L290 TraceCheckUtils]: 328: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,278 INFO L290 TraceCheckUtils]: 327: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,278 INFO L290 TraceCheckUtils]: 326: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,278 INFO L290 TraceCheckUtils]: 325: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,278 INFO L290 TraceCheckUtils]: 324: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,279 INFO L290 TraceCheckUtils]: 323: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,279 INFO L290 TraceCheckUtils]: 322: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,279 INFO L290 TraceCheckUtils]: 321: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,279 INFO L290 TraceCheckUtils]: 320: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,279 INFO L290 TraceCheckUtils]: 319: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,280 INFO L290 TraceCheckUtils]: 318: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,280 INFO L290 TraceCheckUtils]: 317: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,280 INFO L290 TraceCheckUtils]: 316: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,280 INFO L290 TraceCheckUtils]: 315: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,281 INFO L290 TraceCheckUtils]: 314: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,281 INFO L290 TraceCheckUtils]: 313: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,281 INFO L290 TraceCheckUtils]: 312: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,281 INFO L290 TraceCheckUtils]: 311: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,282 INFO L290 TraceCheckUtils]: 310: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,282 INFO L290 TraceCheckUtils]: 309: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,282 INFO L290 TraceCheckUtils]: 308: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,282 INFO L290 TraceCheckUtils]: 307: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,282 INFO L290 TraceCheckUtils]: 306: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,283 INFO L290 TraceCheckUtils]: 305: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,283 INFO L290 TraceCheckUtils]: 304: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,283 INFO L290 TraceCheckUtils]: 303: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,283 INFO L290 TraceCheckUtils]: 302: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,284 INFO L290 TraceCheckUtils]: 301: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,284 INFO L290 TraceCheckUtils]: 300: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,284 INFO L290 TraceCheckUtils]: 299: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,284 INFO L290 TraceCheckUtils]: 298: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,285 INFO L290 TraceCheckUtils]: 297: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,285 INFO L290 TraceCheckUtils]: 296: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,285 INFO L290 TraceCheckUtils]: 295: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,285 INFO L290 TraceCheckUtils]: 294: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,285 INFO L290 TraceCheckUtils]: 293: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,286 INFO L290 TraceCheckUtils]: 292: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,286 INFO L290 TraceCheckUtils]: 291: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,286 INFO L290 TraceCheckUtils]: 290: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,286 INFO L290 TraceCheckUtils]: 289: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,287 INFO L290 TraceCheckUtils]: 288: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,287 INFO L290 TraceCheckUtils]: 287: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,287 INFO L290 TraceCheckUtils]: 286: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,287 INFO L290 TraceCheckUtils]: 285: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,288 INFO L290 TraceCheckUtils]: 284: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,288 INFO L290 TraceCheckUtils]: 283: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,288 INFO L290 TraceCheckUtils]: 282: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,288 INFO L290 TraceCheckUtils]: 281: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,288 INFO L290 TraceCheckUtils]: 280: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,289 INFO L290 TraceCheckUtils]: 279: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,289 INFO L290 TraceCheckUtils]: 278: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,289 INFO L290 TraceCheckUtils]: 277: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,289 INFO L290 TraceCheckUtils]: 276: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,290 INFO L290 TraceCheckUtils]: 275: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,290 INFO L290 TraceCheckUtils]: 274: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,290 INFO L290 TraceCheckUtils]: 273: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,290 INFO L290 TraceCheckUtils]: 272: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,290 INFO L290 TraceCheckUtils]: 271: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,291 INFO L290 TraceCheckUtils]: 270: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,291 INFO L290 TraceCheckUtils]: 269: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,291 INFO L290 TraceCheckUtils]: 268: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,291 INFO L290 TraceCheckUtils]: 267: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,292 INFO L290 TraceCheckUtils]: 266: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,292 INFO L290 TraceCheckUtils]: 265: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,292 INFO L290 TraceCheckUtils]: 264: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,292 INFO L290 TraceCheckUtils]: 263: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,293 INFO L290 TraceCheckUtils]: 262: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,293 INFO L290 TraceCheckUtils]: 261: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,293 INFO L290 TraceCheckUtils]: 260: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,293 INFO L290 TraceCheckUtils]: 259: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,293 INFO L290 TraceCheckUtils]: 258: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,294 INFO L290 TraceCheckUtils]: 257: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,294 INFO L290 TraceCheckUtils]: 256: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,294 INFO L290 TraceCheckUtils]: 255: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,294 INFO L290 TraceCheckUtils]: 254: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,295 INFO L290 TraceCheckUtils]: 253: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,295 INFO L290 TraceCheckUtils]: 252: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,295 INFO L290 TraceCheckUtils]: 251: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,295 INFO L290 TraceCheckUtils]: 250: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,296 INFO L290 TraceCheckUtils]: 249: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,296 INFO L290 TraceCheckUtils]: 248: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,296 INFO L290 TraceCheckUtils]: 247: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,296 INFO L290 TraceCheckUtils]: 246: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,296 INFO L290 TraceCheckUtils]: 245: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,297 INFO L290 TraceCheckUtils]: 244: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,297 INFO L290 TraceCheckUtils]: 243: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,297 INFO L290 TraceCheckUtils]: 242: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,297 INFO L290 TraceCheckUtils]: 241: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,298 INFO L290 TraceCheckUtils]: 240: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,298 INFO L290 TraceCheckUtils]: 239: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,298 INFO L290 TraceCheckUtils]: 238: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,298 INFO L290 TraceCheckUtils]: 237: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,298 INFO L290 TraceCheckUtils]: 236: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,299 INFO L290 TraceCheckUtils]: 235: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,299 INFO L290 TraceCheckUtils]: 234: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,299 INFO L290 TraceCheckUtils]: 233: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,299 INFO L290 TraceCheckUtils]: 232: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,300 INFO L290 TraceCheckUtils]: 231: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,300 INFO L290 TraceCheckUtils]: 230: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,300 INFO L290 TraceCheckUtils]: 229: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,300 INFO L290 TraceCheckUtils]: 228: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,300 INFO L290 TraceCheckUtils]: 227: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,301 INFO L290 TraceCheckUtils]: 226: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,301 INFO L290 TraceCheckUtils]: 225: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,301 INFO L290 TraceCheckUtils]: 224: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,301 INFO L290 TraceCheckUtils]: 223: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,302 INFO L290 TraceCheckUtils]: 222: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,302 INFO L290 TraceCheckUtils]: 221: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,302 INFO L290 TraceCheckUtils]: 220: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,302 INFO L290 TraceCheckUtils]: 219: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,303 INFO L290 TraceCheckUtils]: 218: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,303 INFO L290 TraceCheckUtils]: 217: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,303 INFO L290 TraceCheckUtils]: 216: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,303 INFO L290 TraceCheckUtils]: 215: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,303 INFO L290 TraceCheckUtils]: 214: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,304 INFO L290 TraceCheckUtils]: 213: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,304 INFO L290 TraceCheckUtils]: 212: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,304 INFO L290 TraceCheckUtils]: 211: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,304 INFO L290 TraceCheckUtils]: 210: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,305 INFO L290 TraceCheckUtils]: 209: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,305 INFO L290 TraceCheckUtils]: 208: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,305 INFO L290 TraceCheckUtils]: 207: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,305 INFO L290 TraceCheckUtils]: 206: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,305 INFO L290 TraceCheckUtils]: 205: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,306 INFO L290 TraceCheckUtils]: 204: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,306 INFO L290 TraceCheckUtils]: 203: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,306 INFO L290 TraceCheckUtils]: 202: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,306 INFO L290 TraceCheckUtils]: 201: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,307 INFO L290 TraceCheckUtils]: 200: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,307 INFO L290 TraceCheckUtils]: 199: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,307 INFO L290 TraceCheckUtils]: 198: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,307 INFO L290 TraceCheckUtils]: 197: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,308 INFO L290 TraceCheckUtils]: 196: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,308 INFO L290 TraceCheckUtils]: 195: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,308 INFO L290 TraceCheckUtils]: 194: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,308 INFO L290 TraceCheckUtils]: 193: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,308 INFO L290 TraceCheckUtils]: 192: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,309 INFO L290 TraceCheckUtils]: 191: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,309 INFO L290 TraceCheckUtils]: 190: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,309 INFO L290 TraceCheckUtils]: 189: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,309 INFO L290 TraceCheckUtils]: 188: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,310 INFO L290 TraceCheckUtils]: 187: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,310 INFO L290 TraceCheckUtils]: 186: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,310 INFO L290 TraceCheckUtils]: 185: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,310 INFO L290 TraceCheckUtils]: 184: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,310 INFO L290 TraceCheckUtils]: 183: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,311 INFO L290 TraceCheckUtils]: 182: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,311 INFO L290 TraceCheckUtils]: 181: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,311 INFO L290 TraceCheckUtils]: 180: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,311 INFO L290 TraceCheckUtils]: 179: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,312 INFO L290 TraceCheckUtils]: 178: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,312 INFO L290 TraceCheckUtils]: 177: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,312 INFO L290 TraceCheckUtils]: 176: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,312 INFO L290 TraceCheckUtils]: 175: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,312 INFO L290 TraceCheckUtils]: 174: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,313 INFO L290 TraceCheckUtils]: 173: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,313 INFO L290 TraceCheckUtils]: 172: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,313 INFO L290 TraceCheckUtils]: 171: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,313 INFO L290 TraceCheckUtils]: 170: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,314 INFO L290 TraceCheckUtils]: 169: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,314 INFO L290 TraceCheckUtils]: 168: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,314 INFO L290 TraceCheckUtils]: 167: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,314 INFO L290 TraceCheckUtils]: 166: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,315 INFO L290 TraceCheckUtils]: 165: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,315 INFO L290 TraceCheckUtils]: 164: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,315 INFO L290 TraceCheckUtils]: 163: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,315 INFO L290 TraceCheckUtils]: 162: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,315 INFO L290 TraceCheckUtils]: 161: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,316 INFO L290 TraceCheckUtils]: 160: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,316 INFO L290 TraceCheckUtils]: 159: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,316 INFO L290 TraceCheckUtils]: 158: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,316 INFO L290 TraceCheckUtils]: 157: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,317 INFO L290 TraceCheckUtils]: 156: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,317 INFO L290 TraceCheckUtils]: 155: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,317 INFO L290 TraceCheckUtils]: 154: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,317 INFO L290 TraceCheckUtils]: 153: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,317 INFO L290 TraceCheckUtils]: 152: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,318 INFO L290 TraceCheckUtils]: 151: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,318 INFO L290 TraceCheckUtils]: 150: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,318 INFO L290 TraceCheckUtils]: 149: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,318 INFO L290 TraceCheckUtils]: 148: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,319 INFO L290 TraceCheckUtils]: 147: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,319 INFO L290 TraceCheckUtils]: 146: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,319 INFO L290 TraceCheckUtils]: 145: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,319 INFO L290 TraceCheckUtils]: 144: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,320 INFO L290 TraceCheckUtils]: 143: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,320 INFO L290 TraceCheckUtils]: 142: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,320 INFO L290 TraceCheckUtils]: 141: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,320 INFO L290 TraceCheckUtils]: 140: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,320 INFO L290 TraceCheckUtils]: 139: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,321 INFO L290 TraceCheckUtils]: 138: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,321 INFO L290 TraceCheckUtils]: 137: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,321 INFO L290 TraceCheckUtils]: 136: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,321 INFO L290 TraceCheckUtils]: 135: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,322 INFO L290 TraceCheckUtils]: 134: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,322 INFO L290 TraceCheckUtils]: 133: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,322 INFO L290 TraceCheckUtils]: 132: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,322 INFO L290 TraceCheckUtils]: 131: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,323 INFO L290 TraceCheckUtils]: 130: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,323 INFO L290 TraceCheckUtils]: 129: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,323 INFO L290 TraceCheckUtils]: 128: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,323 INFO L290 TraceCheckUtils]: 127: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,323 INFO L290 TraceCheckUtils]: 126: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,324 INFO L290 TraceCheckUtils]: 125: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,324 INFO L290 TraceCheckUtils]: 124: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,324 INFO L290 TraceCheckUtils]: 123: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,324 INFO L290 TraceCheckUtils]: 122: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,325 INFO L290 TraceCheckUtils]: 121: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,325 INFO L290 TraceCheckUtils]: 120: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,325 INFO L290 TraceCheckUtils]: 119: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,325 INFO L290 TraceCheckUtils]: 118: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,325 INFO L290 TraceCheckUtils]: 117: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,326 INFO L290 TraceCheckUtils]: 116: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,326 INFO L290 TraceCheckUtils]: 115: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,326 INFO L290 TraceCheckUtils]: 114: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,326 INFO L290 TraceCheckUtils]: 113: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,327 INFO L290 TraceCheckUtils]: 112: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,327 INFO L290 TraceCheckUtils]: 111: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,327 INFO L290 TraceCheckUtils]: 110: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,327 INFO L290 TraceCheckUtils]: 109: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,327 INFO L290 TraceCheckUtils]: 108: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,328 INFO L290 TraceCheckUtils]: 107: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,328 INFO L290 TraceCheckUtils]: 106: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,328 INFO L290 TraceCheckUtils]: 105: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,328 INFO L290 TraceCheckUtils]: 104: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,329 INFO L290 TraceCheckUtils]: 103: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,329 INFO L290 TraceCheckUtils]: 102: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,329 INFO L290 TraceCheckUtils]: 101: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,329 INFO L290 TraceCheckUtils]: 100: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,330 INFO L290 TraceCheckUtils]: 99: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,330 INFO L290 TraceCheckUtils]: 98: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,330 INFO L290 TraceCheckUtils]: 95: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,333 INFO L290 TraceCheckUtils]: 85: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,333 INFO L290 TraceCheckUtils]: 84: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,333 INFO L290 TraceCheckUtils]: 83: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,333 INFO L290 TraceCheckUtils]: 82: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,334 INFO L290 TraceCheckUtils]: 81: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,335 INFO L290 TraceCheckUtils]: 77: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,335 INFO L290 TraceCheckUtils]: 75: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,335 INFO L290 TraceCheckUtils]: 73: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,336 INFO L290 TraceCheckUtils]: 71: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,339 INFO L290 TraceCheckUtils]: 55: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {50062#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {50062#(< 4 main_~edgecount~0)} ~i~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {50062#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {50062#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {50062#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {48906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {50062#(< 4 main_~edgecount~0)} is VALID [2022-04-28 09:01:51,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {48906#true} call #t~ret22 := main(); {48906#true} is VALID [2022-04-28 09:01:51,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48906#true} {48906#true} #107#return; {48906#true} is VALID [2022-04-28 09:01:51,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {48906#true} assume true; {48906#true} is VALID [2022-04-28 09:01:51,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {48906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {48906#true} is VALID [2022-04-28 09:01:51,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {48906#true} call ULTIMATE.init(); {48906#true} is VALID [2022-04-28 09:01:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15442 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:51,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926879342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:51,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:51,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-28 09:01:51,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:51,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762771225] [2022-04-28 09:01:51,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762771225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:51,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:51,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:01:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750085762] [2022-04-28 09:01:51,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:51,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 359 [2022-04-28 09:01:51,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:51,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:51,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:51,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:01:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:51,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:01:51,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:01:51,379 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:53,564 INFO L93 Difference]: Finished difference Result 464 states and 600 transitions. [2022-04-28 09:01:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:01:53,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 359 [2022-04-28 09:01:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-28 09:01:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-04-28 09:01:53,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 138 transitions. [2022-04-28 09:01:53,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:53,689 INFO L225 Difference]: With dead ends: 464 [2022-04-28 09:01:53,689 INFO L226 Difference]: Without dead ends: 453 [2022-04-28 09:01:53,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:01:53,689 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 212 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:53,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 39 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:01:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-28 09:01:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 367. [2022-04-28 09:01:55,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:55,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:55,139 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:55,139 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,146 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-28 09:01:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-28 09:01:55,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:55,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:55,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 453 states. [2022-04-28 09:01:55,147 INFO L87 Difference]: Start difference. First operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 453 states. [2022-04-28 09:01:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,155 INFO L93 Difference]: Finished difference Result 453 states and 588 transitions. [2022-04-28 09:01:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2022-04-28 09:01:55,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:55,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:55,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:55,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 361 states have (on average 1.3047091412742382) internal successors, (471), 361 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 476 transitions. [2022-04-28 09:01:55,161 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 476 transitions. Word has length 359 [2022-04-28 09:01:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:55,162 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 476 transitions. [2022-04-28 09:01:55,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 476 transitions. [2022-04-28 09:01:56,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 476 transitions. [2022-04-28 09:01:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-04-28 09:01:56,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:56,064 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:56,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:56,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:56,265 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:56,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 61 times [2022-04-28 09:01:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:56,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032867287] [2022-04-28 09:01:56,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:56,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -121056614, now seen corresponding path program 62 times [2022-04-28 09:01:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:56,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428880053] [2022-04-28 09:01:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-28 09:01:56,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-28 09:01:56,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-28 09:01:56,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:56,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {53674#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-28 09:01:56,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-28 09:01:56,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-28 09:01:56,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-28 09:01:56,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,607 INFO L290 TraceCheckUtils]: 76: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,608 INFO L290 TraceCheckUtils]: 77: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,608 INFO L290 TraceCheckUtils]: 79: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,608 INFO L290 TraceCheckUtils]: 80: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,609 INFO L290 TraceCheckUtils]: 82: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,609 INFO L290 TraceCheckUtils]: 83: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,609 INFO L290 TraceCheckUtils]: 84: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,609 INFO L290 TraceCheckUtils]: 85: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,610 INFO L290 TraceCheckUtils]: 86: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,610 INFO L290 TraceCheckUtils]: 87: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,610 INFO L290 TraceCheckUtils]: 88: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,610 INFO L290 TraceCheckUtils]: 89: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,610 INFO L290 TraceCheckUtils]: 90: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,611 INFO L290 TraceCheckUtils]: 91: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,611 INFO L290 TraceCheckUtils]: 92: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,611 INFO L290 TraceCheckUtils]: 93: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,611 INFO L290 TraceCheckUtils]: 94: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,612 INFO L290 TraceCheckUtils]: 95: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,612 INFO L290 TraceCheckUtils]: 96: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,612 INFO L290 TraceCheckUtils]: 97: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,612 INFO L290 TraceCheckUtils]: 98: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,612 INFO L290 TraceCheckUtils]: 99: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,613 INFO L290 TraceCheckUtils]: 100: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,613 INFO L290 TraceCheckUtils]: 101: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,613 INFO L290 TraceCheckUtils]: 102: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,613 INFO L290 TraceCheckUtils]: 103: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,614 INFO L290 TraceCheckUtils]: 104: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,614 INFO L290 TraceCheckUtils]: 105: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,614 INFO L290 TraceCheckUtils]: 106: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,614 INFO L290 TraceCheckUtils]: 107: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,614 INFO L290 TraceCheckUtils]: 108: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,615 INFO L290 TraceCheckUtils]: 109: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,615 INFO L290 TraceCheckUtils]: 110: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,615 INFO L290 TraceCheckUtils]: 111: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,615 INFO L290 TraceCheckUtils]: 112: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,616 INFO L290 TraceCheckUtils]: 113: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,616 INFO L290 TraceCheckUtils]: 114: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,616 INFO L290 TraceCheckUtils]: 115: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,616 INFO L290 TraceCheckUtils]: 116: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,616 INFO L290 TraceCheckUtils]: 117: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,617 INFO L290 TraceCheckUtils]: 118: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,617 INFO L290 TraceCheckUtils]: 119: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,617 INFO L290 TraceCheckUtils]: 120: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,617 INFO L290 TraceCheckUtils]: 121: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,618 INFO L290 TraceCheckUtils]: 122: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,618 INFO L290 TraceCheckUtils]: 123: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,618 INFO L290 TraceCheckUtils]: 124: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,618 INFO L290 TraceCheckUtils]: 125: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,618 INFO L290 TraceCheckUtils]: 126: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,619 INFO L290 TraceCheckUtils]: 127: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,619 INFO L290 TraceCheckUtils]: 128: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,619 INFO L290 TraceCheckUtils]: 129: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,619 INFO L290 TraceCheckUtils]: 130: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,620 INFO L290 TraceCheckUtils]: 131: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,620 INFO L290 TraceCheckUtils]: 132: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,620 INFO L290 TraceCheckUtils]: 133: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,620 INFO L290 TraceCheckUtils]: 134: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,621 INFO L290 TraceCheckUtils]: 135: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,621 INFO L290 TraceCheckUtils]: 136: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,621 INFO L290 TraceCheckUtils]: 137: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,621 INFO L290 TraceCheckUtils]: 138: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,621 INFO L290 TraceCheckUtils]: 139: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,622 INFO L290 TraceCheckUtils]: 140: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,622 INFO L290 TraceCheckUtils]: 141: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,622 INFO L290 TraceCheckUtils]: 142: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,622 INFO L290 TraceCheckUtils]: 143: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,623 INFO L290 TraceCheckUtils]: 144: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,623 INFO L290 TraceCheckUtils]: 145: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,623 INFO L290 TraceCheckUtils]: 146: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,623 INFO L290 TraceCheckUtils]: 147: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,623 INFO L290 TraceCheckUtils]: 148: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,624 INFO L290 TraceCheckUtils]: 149: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,624 INFO L290 TraceCheckUtils]: 150: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,624 INFO L290 TraceCheckUtils]: 151: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,624 INFO L290 TraceCheckUtils]: 152: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,625 INFO L290 TraceCheckUtils]: 153: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,625 INFO L290 TraceCheckUtils]: 154: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,625 INFO L290 TraceCheckUtils]: 155: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,625 INFO L290 TraceCheckUtils]: 156: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,625 INFO L290 TraceCheckUtils]: 157: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,626 INFO L290 TraceCheckUtils]: 158: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,626 INFO L290 TraceCheckUtils]: 159: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,626 INFO L290 TraceCheckUtils]: 160: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,626 INFO L290 TraceCheckUtils]: 161: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,627 INFO L290 TraceCheckUtils]: 162: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,627 INFO L290 TraceCheckUtils]: 163: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,631 INFO L290 TraceCheckUtils]: 164: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,631 INFO L290 TraceCheckUtils]: 165: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,631 INFO L290 TraceCheckUtils]: 166: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,632 INFO L290 TraceCheckUtils]: 167: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,632 INFO L290 TraceCheckUtils]: 168: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,632 INFO L290 TraceCheckUtils]: 169: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,632 INFO L290 TraceCheckUtils]: 170: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,633 INFO L290 TraceCheckUtils]: 171: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,633 INFO L290 TraceCheckUtils]: 172: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,633 INFO L290 TraceCheckUtils]: 173: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,633 INFO L290 TraceCheckUtils]: 174: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,633 INFO L290 TraceCheckUtils]: 175: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,634 INFO L290 TraceCheckUtils]: 176: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,634 INFO L290 TraceCheckUtils]: 177: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,634 INFO L290 TraceCheckUtils]: 178: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,634 INFO L290 TraceCheckUtils]: 179: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,635 INFO L290 TraceCheckUtils]: 180: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,635 INFO L290 TraceCheckUtils]: 181: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,635 INFO L290 TraceCheckUtils]: 182: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,635 INFO L290 TraceCheckUtils]: 183: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,635 INFO L290 TraceCheckUtils]: 184: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,636 INFO L290 TraceCheckUtils]: 185: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,636 INFO L290 TraceCheckUtils]: 186: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,636 INFO L290 TraceCheckUtils]: 187: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,636 INFO L290 TraceCheckUtils]: 188: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,637 INFO L290 TraceCheckUtils]: 189: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,637 INFO L290 TraceCheckUtils]: 190: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,637 INFO L290 TraceCheckUtils]: 191: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,637 INFO L290 TraceCheckUtils]: 192: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,637 INFO L290 TraceCheckUtils]: 193: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,638 INFO L290 TraceCheckUtils]: 194: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,638 INFO L290 TraceCheckUtils]: 195: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,638 INFO L290 TraceCheckUtils]: 196: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,638 INFO L290 TraceCheckUtils]: 197: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,639 INFO L290 TraceCheckUtils]: 198: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,639 INFO L290 TraceCheckUtils]: 199: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,639 INFO L290 TraceCheckUtils]: 200: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,639 INFO L290 TraceCheckUtils]: 201: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,640 INFO L290 TraceCheckUtils]: 202: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,640 INFO L290 TraceCheckUtils]: 203: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,640 INFO L290 TraceCheckUtils]: 204: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,640 INFO L290 TraceCheckUtils]: 205: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,640 INFO L290 TraceCheckUtils]: 206: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,641 INFO L290 TraceCheckUtils]: 207: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,641 INFO L290 TraceCheckUtils]: 208: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,641 INFO L290 TraceCheckUtils]: 209: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,641 INFO L290 TraceCheckUtils]: 210: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,642 INFO L290 TraceCheckUtils]: 211: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,642 INFO L290 TraceCheckUtils]: 212: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,642 INFO L290 TraceCheckUtils]: 213: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,642 INFO L290 TraceCheckUtils]: 214: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,643 INFO L290 TraceCheckUtils]: 215: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,643 INFO L290 TraceCheckUtils]: 216: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,643 INFO L290 TraceCheckUtils]: 217: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,643 INFO L290 TraceCheckUtils]: 218: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,644 INFO L290 TraceCheckUtils]: 219: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,644 INFO L290 TraceCheckUtils]: 220: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,644 INFO L290 TraceCheckUtils]: 221: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,644 INFO L290 TraceCheckUtils]: 222: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,645 INFO L290 TraceCheckUtils]: 223: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,645 INFO L290 TraceCheckUtils]: 224: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,645 INFO L290 TraceCheckUtils]: 225: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,645 INFO L290 TraceCheckUtils]: 226: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,646 INFO L290 TraceCheckUtils]: 227: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,646 INFO L290 TraceCheckUtils]: 228: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,646 INFO L290 TraceCheckUtils]: 229: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,646 INFO L290 TraceCheckUtils]: 230: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,646 INFO L290 TraceCheckUtils]: 231: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,647 INFO L290 TraceCheckUtils]: 232: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,647 INFO L290 TraceCheckUtils]: 233: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,647 INFO L290 TraceCheckUtils]: 234: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,647 INFO L290 TraceCheckUtils]: 235: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,648 INFO L290 TraceCheckUtils]: 236: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,648 INFO L290 TraceCheckUtils]: 237: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,648 INFO L290 TraceCheckUtils]: 238: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,648 INFO L290 TraceCheckUtils]: 239: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,649 INFO L290 TraceCheckUtils]: 240: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,649 INFO L290 TraceCheckUtils]: 241: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,649 INFO L290 TraceCheckUtils]: 242: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,649 INFO L290 TraceCheckUtils]: 243: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,650 INFO L290 TraceCheckUtils]: 244: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,650 INFO L290 TraceCheckUtils]: 245: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,650 INFO L290 TraceCheckUtils]: 246: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,650 INFO L290 TraceCheckUtils]: 247: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,650 INFO L290 TraceCheckUtils]: 248: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,651 INFO L290 TraceCheckUtils]: 249: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,651 INFO L290 TraceCheckUtils]: 250: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,651 INFO L290 TraceCheckUtils]: 251: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,651 INFO L290 TraceCheckUtils]: 252: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,652 INFO L290 TraceCheckUtils]: 253: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,652 INFO L290 TraceCheckUtils]: 254: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,652 INFO L290 TraceCheckUtils]: 255: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,652 INFO L290 TraceCheckUtils]: 256: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,652 INFO L290 TraceCheckUtils]: 257: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,653 INFO L290 TraceCheckUtils]: 258: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,653 INFO L290 TraceCheckUtils]: 259: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,653 INFO L290 TraceCheckUtils]: 260: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,653 INFO L290 TraceCheckUtils]: 261: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,654 INFO L290 TraceCheckUtils]: 262: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,654 INFO L290 TraceCheckUtils]: 263: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,654 INFO L290 TraceCheckUtils]: 264: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,654 INFO L290 TraceCheckUtils]: 265: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,654 INFO L290 TraceCheckUtils]: 266: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,655 INFO L290 TraceCheckUtils]: 267: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,655 INFO L290 TraceCheckUtils]: 268: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,655 INFO L290 TraceCheckUtils]: 269: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,655 INFO L290 TraceCheckUtils]: 270: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,656 INFO L290 TraceCheckUtils]: 271: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,656 INFO L290 TraceCheckUtils]: 272: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,656 INFO L290 TraceCheckUtils]: 273: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,656 INFO L290 TraceCheckUtils]: 274: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,657 INFO L290 TraceCheckUtils]: 275: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,657 INFO L290 TraceCheckUtils]: 276: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,657 INFO L290 TraceCheckUtils]: 277: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,657 INFO L290 TraceCheckUtils]: 278: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,657 INFO L290 TraceCheckUtils]: 279: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,658 INFO L290 TraceCheckUtils]: 280: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,658 INFO L290 TraceCheckUtils]: 281: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,658 INFO L290 TraceCheckUtils]: 282: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,658 INFO L290 TraceCheckUtils]: 283: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,659 INFO L290 TraceCheckUtils]: 284: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,659 INFO L290 TraceCheckUtils]: 285: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,659 INFO L290 TraceCheckUtils]: 286: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,659 INFO L290 TraceCheckUtils]: 287: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,659 INFO L290 TraceCheckUtils]: 288: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,660 INFO L290 TraceCheckUtils]: 289: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,660 INFO L290 TraceCheckUtils]: 290: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,660 INFO L290 TraceCheckUtils]: 291: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,660 INFO L290 TraceCheckUtils]: 292: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,661 INFO L290 TraceCheckUtils]: 293: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,661 INFO L290 TraceCheckUtils]: 294: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,661 INFO L290 TraceCheckUtils]: 295: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,661 INFO L290 TraceCheckUtils]: 296: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,662 INFO L290 TraceCheckUtils]: 297: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,662 INFO L290 TraceCheckUtils]: 298: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,662 INFO L290 TraceCheckUtils]: 299: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,662 INFO L290 TraceCheckUtils]: 300: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,662 INFO L290 TraceCheckUtils]: 301: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,663 INFO L290 TraceCheckUtils]: 302: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,663 INFO L290 TraceCheckUtils]: 303: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,663 INFO L290 TraceCheckUtils]: 304: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,663 INFO L290 TraceCheckUtils]: 305: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,664 INFO L290 TraceCheckUtils]: 306: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,664 INFO L290 TraceCheckUtils]: 307: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,664 INFO L290 TraceCheckUtils]: 308: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,664 INFO L290 TraceCheckUtils]: 309: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,664 INFO L290 TraceCheckUtils]: 310: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,665 INFO L290 TraceCheckUtils]: 311: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,665 INFO L290 TraceCheckUtils]: 312: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,665 INFO L290 TraceCheckUtils]: 313: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,665 INFO L290 TraceCheckUtils]: 314: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,666 INFO L290 TraceCheckUtils]: 315: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,666 INFO L290 TraceCheckUtils]: 316: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,666 INFO L290 TraceCheckUtils]: 317: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,666 INFO L290 TraceCheckUtils]: 318: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,666 INFO L290 TraceCheckUtils]: 319: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,667 INFO L290 TraceCheckUtils]: 320: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,667 INFO L290 TraceCheckUtils]: 321: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,667 INFO L290 TraceCheckUtils]: 322: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,667 INFO L290 TraceCheckUtils]: 323: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,668 INFO L290 TraceCheckUtils]: 324: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,668 INFO L290 TraceCheckUtils]: 325: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,668 INFO L290 TraceCheckUtils]: 326: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,668 INFO L290 TraceCheckUtils]: 327: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,668 INFO L290 TraceCheckUtils]: 328: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,669 INFO L290 TraceCheckUtils]: 329: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,669 INFO L290 TraceCheckUtils]: 330: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,669 INFO L290 TraceCheckUtils]: 331: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,669 INFO L290 TraceCheckUtils]: 332: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,670 INFO L290 TraceCheckUtils]: 333: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,670 INFO L290 TraceCheckUtils]: 334: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,670 INFO L290 TraceCheckUtils]: 335: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,670 INFO L290 TraceCheckUtils]: 336: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,670 INFO L290 TraceCheckUtils]: 337: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,671 INFO L290 TraceCheckUtils]: 338: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:56,671 INFO L290 TraceCheckUtils]: 339: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:56,671 INFO L290 TraceCheckUtils]: 340: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:56,672 INFO L290 TraceCheckUtils]: 341: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:01:56,672 INFO L290 TraceCheckUtils]: 342: Hoare triple {53668#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,673 INFO L290 TraceCheckUtils]: 343: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,673 INFO L290 TraceCheckUtils]: 344: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,673 INFO L290 TraceCheckUtils]: 345: Hoare triple {53669#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,673 INFO L290 TraceCheckUtils]: 346: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,674 INFO L290 TraceCheckUtils]: 347: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,674 INFO L290 TraceCheckUtils]: 348: Hoare triple {53670#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,674 INFO L290 TraceCheckUtils]: 349: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,674 INFO L290 TraceCheckUtils]: 350: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,675 INFO L290 TraceCheckUtils]: 351: Hoare triple {53671#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,675 INFO L290 TraceCheckUtils]: 352: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,675 INFO L290 TraceCheckUtils]: 353: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,676 INFO L290 TraceCheckUtils]: 354: Hoare triple {53672#(<= (+ main_~i~0 16) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {53673#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:01:56,676 INFO L290 TraceCheckUtils]: 355: Hoare triple {53673#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-28 09:01:56,676 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-28 09:01:56,676 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-28 09:01:56,676 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-28 09:01:56,676 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-28 09:01:56,676 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-28 09:01:56,676 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-28 09:01:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:56,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:56,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428880053] [2022-04-28 09:01:56,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428880053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:56,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272237842] [2022-04-28 09:01:56,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:56,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:56,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:56,678 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:56,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 09:01:57,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:57,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:57,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:01:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:57,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:58,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-28 09:01:58,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-28 09:01:58,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-28 09:01:58,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-28 09:01:58,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-28 09:01:58,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,485 INFO L290 TraceCheckUtils]: 66: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,485 INFO L290 TraceCheckUtils]: 67: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,486 INFO L290 TraceCheckUtils]: 70: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,486 INFO L290 TraceCheckUtils]: 72: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,486 INFO L290 TraceCheckUtils]: 73: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,487 INFO L290 TraceCheckUtils]: 74: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,487 INFO L290 TraceCheckUtils]: 75: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,487 INFO L290 TraceCheckUtils]: 78: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,488 INFO L290 TraceCheckUtils]: 79: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,488 INFO L290 TraceCheckUtils]: 80: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,488 INFO L290 TraceCheckUtils]: 81: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,488 INFO L290 TraceCheckUtils]: 82: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,489 INFO L290 TraceCheckUtils]: 83: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,489 INFO L290 TraceCheckUtils]: 84: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,489 INFO L290 TraceCheckUtils]: 85: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,489 INFO L290 TraceCheckUtils]: 86: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,490 INFO L290 TraceCheckUtils]: 87: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,490 INFO L290 TraceCheckUtils]: 88: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,490 INFO L290 TraceCheckUtils]: 89: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,490 INFO L290 TraceCheckUtils]: 90: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,490 INFO L290 TraceCheckUtils]: 91: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 92: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 93: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 94: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 95: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,492 INFO L290 TraceCheckUtils]: 96: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,492 INFO L290 TraceCheckUtils]: 97: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,492 INFO L290 TraceCheckUtils]: 98: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,492 INFO L290 TraceCheckUtils]: 99: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 100: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 101: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 102: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 103: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 104: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,494 INFO L290 TraceCheckUtils]: 105: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,494 INFO L290 TraceCheckUtils]: 106: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,494 INFO L290 TraceCheckUtils]: 107: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,494 INFO L290 TraceCheckUtils]: 108: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,495 INFO L290 TraceCheckUtils]: 109: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,495 INFO L290 TraceCheckUtils]: 110: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,495 INFO L290 TraceCheckUtils]: 111: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,495 INFO L290 TraceCheckUtils]: 112: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,496 INFO L290 TraceCheckUtils]: 113: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,496 INFO L290 TraceCheckUtils]: 114: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,496 INFO L290 TraceCheckUtils]: 115: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,496 INFO L290 TraceCheckUtils]: 116: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,497 INFO L290 TraceCheckUtils]: 117: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,497 INFO L290 TraceCheckUtils]: 118: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,497 INFO L290 TraceCheckUtils]: 119: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,497 INFO L290 TraceCheckUtils]: 120: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,497 INFO L290 TraceCheckUtils]: 121: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,498 INFO L290 TraceCheckUtils]: 122: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,498 INFO L290 TraceCheckUtils]: 123: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,498 INFO L290 TraceCheckUtils]: 124: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,498 INFO L290 TraceCheckUtils]: 125: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,499 INFO L290 TraceCheckUtils]: 126: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,499 INFO L290 TraceCheckUtils]: 127: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,499 INFO L290 TraceCheckUtils]: 128: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,499 INFO L290 TraceCheckUtils]: 129: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,499 INFO L290 TraceCheckUtils]: 130: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,500 INFO L290 TraceCheckUtils]: 131: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,500 INFO L290 TraceCheckUtils]: 132: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,500 INFO L290 TraceCheckUtils]: 133: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,500 INFO L290 TraceCheckUtils]: 134: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,501 INFO L290 TraceCheckUtils]: 135: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,501 INFO L290 TraceCheckUtils]: 136: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,501 INFO L290 TraceCheckUtils]: 137: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,501 INFO L290 TraceCheckUtils]: 138: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,502 INFO L290 TraceCheckUtils]: 139: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,502 INFO L290 TraceCheckUtils]: 140: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,502 INFO L290 TraceCheckUtils]: 141: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,502 INFO L290 TraceCheckUtils]: 142: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,502 INFO L290 TraceCheckUtils]: 143: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,503 INFO L290 TraceCheckUtils]: 144: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,503 INFO L290 TraceCheckUtils]: 145: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,503 INFO L290 TraceCheckUtils]: 146: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,503 INFO L290 TraceCheckUtils]: 147: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,504 INFO L290 TraceCheckUtils]: 148: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,504 INFO L290 TraceCheckUtils]: 149: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,504 INFO L290 TraceCheckUtils]: 150: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,504 INFO L290 TraceCheckUtils]: 151: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,505 INFO L290 TraceCheckUtils]: 152: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,505 INFO L290 TraceCheckUtils]: 153: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,505 INFO L290 TraceCheckUtils]: 154: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,505 INFO L290 TraceCheckUtils]: 155: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,505 INFO L290 TraceCheckUtils]: 156: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,506 INFO L290 TraceCheckUtils]: 157: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,506 INFO L290 TraceCheckUtils]: 158: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,506 INFO L290 TraceCheckUtils]: 159: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,506 INFO L290 TraceCheckUtils]: 160: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,507 INFO L290 TraceCheckUtils]: 161: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,507 INFO L290 TraceCheckUtils]: 162: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,507 INFO L290 TraceCheckUtils]: 163: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,507 INFO L290 TraceCheckUtils]: 164: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,508 INFO L290 TraceCheckUtils]: 165: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,508 INFO L290 TraceCheckUtils]: 166: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,508 INFO L290 TraceCheckUtils]: 167: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,508 INFO L290 TraceCheckUtils]: 168: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,508 INFO L290 TraceCheckUtils]: 169: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,509 INFO L290 TraceCheckUtils]: 170: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,509 INFO L290 TraceCheckUtils]: 171: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,509 INFO L290 TraceCheckUtils]: 172: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,509 INFO L290 TraceCheckUtils]: 173: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,510 INFO L290 TraceCheckUtils]: 174: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,510 INFO L290 TraceCheckUtils]: 175: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,510 INFO L290 TraceCheckUtils]: 176: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,510 INFO L290 TraceCheckUtils]: 177: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,511 INFO L290 TraceCheckUtils]: 178: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,511 INFO L290 TraceCheckUtils]: 179: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,511 INFO L290 TraceCheckUtils]: 180: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,511 INFO L290 TraceCheckUtils]: 181: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,512 INFO L290 TraceCheckUtils]: 182: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,512 INFO L290 TraceCheckUtils]: 183: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,512 INFO L290 TraceCheckUtils]: 184: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,512 INFO L290 TraceCheckUtils]: 185: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,512 INFO L290 TraceCheckUtils]: 186: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,513 INFO L290 TraceCheckUtils]: 187: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,513 INFO L290 TraceCheckUtils]: 188: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,513 INFO L290 TraceCheckUtils]: 189: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,513 INFO L290 TraceCheckUtils]: 190: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,514 INFO L290 TraceCheckUtils]: 191: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,514 INFO L290 TraceCheckUtils]: 192: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,514 INFO L290 TraceCheckUtils]: 193: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,514 INFO L290 TraceCheckUtils]: 194: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,515 INFO L290 TraceCheckUtils]: 195: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,515 INFO L290 TraceCheckUtils]: 196: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,515 INFO L290 TraceCheckUtils]: 197: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,515 INFO L290 TraceCheckUtils]: 198: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,516 INFO L290 TraceCheckUtils]: 199: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,516 INFO L290 TraceCheckUtils]: 200: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,516 INFO L290 TraceCheckUtils]: 201: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,516 INFO L290 TraceCheckUtils]: 202: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,516 INFO L290 TraceCheckUtils]: 203: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,517 INFO L290 TraceCheckUtils]: 204: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,517 INFO L290 TraceCheckUtils]: 205: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,517 INFO L290 TraceCheckUtils]: 206: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,517 INFO L290 TraceCheckUtils]: 207: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,518 INFO L290 TraceCheckUtils]: 208: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,518 INFO L290 TraceCheckUtils]: 209: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,518 INFO L290 TraceCheckUtils]: 210: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,518 INFO L290 TraceCheckUtils]: 211: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,519 INFO L290 TraceCheckUtils]: 212: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,519 INFO L290 TraceCheckUtils]: 213: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,519 INFO L290 TraceCheckUtils]: 214: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,519 INFO L290 TraceCheckUtils]: 215: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,519 INFO L290 TraceCheckUtils]: 216: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,520 INFO L290 TraceCheckUtils]: 217: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,520 INFO L290 TraceCheckUtils]: 218: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,520 INFO L290 TraceCheckUtils]: 219: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,520 INFO L290 TraceCheckUtils]: 220: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,521 INFO L290 TraceCheckUtils]: 221: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,521 INFO L290 TraceCheckUtils]: 222: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,521 INFO L290 TraceCheckUtils]: 223: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,521 INFO L290 TraceCheckUtils]: 224: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,522 INFO L290 TraceCheckUtils]: 225: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,522 INFO L290 TraceCheckUtils]: 226: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,522 INFO L290 TraceCheckUtils]: 227: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,522 INFO L290 TraceCheckUtils]: 228: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,522 INFO L290 TraceCheckUtils]: 229: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,523 INFO L290 TraceCheckUtils]: 230: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,523 INFO L290 TraceCheckUtils]: 231: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,523 INFO L290 TraceCheckUtils]: 232: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,523 INFO L290 TraceCheckUtils]: 233: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,524 INFO L290 TraceCheckUtils]: 234: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,524 INFO L290 TraceCheckUtils]: 235: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,524 INFO L290 TraceCheckUtils]: 236: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,524 INFO L290 TraceCheckUtils]: 237: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,525 INFO L290 TraceCheckUtils]: 238: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,525 INFO L290 TraceCheckUtils]: 239: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,525 INFO L290 TraceCheckUtils]: 240: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,525 INFO L290 TraceCheckUtils]: 241: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,526 INFO L290 TraceCheckUtils]: 242: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,526 INFO L290 TraceCheckUtils]: 243: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,526 INFO L290 TraceCheckUtils]: 244: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,526 INFO L290 TraceCheckUtils]: 245: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,527 INFO L290 TraceCheckUtils]: 246: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,527 INFO L290 TraceCheckUtils]: 247: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,527 INFO L290 TraceCheckUtils]: 248: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,527 INFO L290 TraceCheckUtils]: 249: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,527 INFO L290 TraceCheckUtils]: 250: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,528 INFO L290 TraceCheckUtils]: 251: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,528 INFO L290 TraceCheckUtils]: 252: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,528 INFO L290 TraceCheckUtils]: 253: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,528 INFO L290 TraceCheckUtils]: 254: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,529 INFO L290 TraceCheckUtils]: 255: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,529 INFO L290 TraceCheckUtils]: 256: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,529 INFO L290 TraceCheckUtils]: 257: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,529 INFO L290 TraceCheckUtils]: 258: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,530 INFO L290 TraceCheckUtils]: 259: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,530 INFO L290 TraceCheckUtils]: 260: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,530 INFO L290 TraceCheckUtils]: 261: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,530 INFO L290 TraceCheckUtils]: 262: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,530 INFO L290 TraceCheckUtils]: 263: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,531 INFO L290 TraceCheckUtils]: 264: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,531 INFO L290 TraceCheckUtils]: 265: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,531 INFO L290 TraceCheckUtils]: 266: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,531 INFO L290 TraceCheckUtils]: 267: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,532 INFO L290 TraceCheckUtils]: 268: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,532 INFO L290 TraceCheckUtils]: 269: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,532 INFO L290 TraceCheckUtils]: 270: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,532 INFO L290 TraceCheckUtils]: 271: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,533 INFO L290 TraceCheckUtils]: 272: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,533 INFO L290 TraceCheckUtils]: 273: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,533 INFO L290 TraceCheckUtils]: 274: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,533 INFO L290 TraceCheckUtils]: 275: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,533 INFO L290 TraceCheckUtils]: 276: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,534 INFO L290 TraceCheckUtils]: 277: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,534 INFO L290 TraceCheckUtils]: 278: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,534 INFO L290 TraceCheckUtils]: 279: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,534 INFO L290 TraceCheckUtils]: 280: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,535 INFO L290 TraceCheckUtils]: 281: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,535 INFO L290 TraceCheckUtils]: 282: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,535 INFO L290 TraceCheckUtils]: 283: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,535 INFO L290 TraceCheckUtils]: 284: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,536 INFO L290 TraceCheckUtils]: 285: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,536 INFO L290 TraceCheckUtils]: 286: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,536 INFO L290 TraceCheckUtils]: 287: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,536 INFO L290 TraceCheckUtils]: 288: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,536 INFO L290 TraceCheckUtils]: 289: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,537 INFO L290 TraceCheckUtils]: 290: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,537 INFO L290 TraceCheckUtils]: 291: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,537 INFO L290 TraceCheckUtils]: 292: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,537 INFO L290 TraceCheckUtils]: 293: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,538 INFO L290 TraceCheckUtils]: 294: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,538 INFO L290 TraceCheckUtils]: 295: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,538 INFO L290 TraceCheckUtils]: 296: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,538 INFO L290 TraceCheckUtils]: 297: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,539 INFO L290 TraceCheckUtils]: 298: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,539 INFO L290 TraceCheckUtils]: 299: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,539 INFO L290 TraceCheckUtils]: 300: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,539 INFO L290 TraceCheckUtils]: 301: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,540 INFO L290 TraceCheckUtils]: 302: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,540 INFO L290 TraceCheckUtils]: 303: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,540 INFO L290 TraceCheckUtils]: 304: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,540 INFO L290 TraceCheckUtils]: 305: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,540 INFO L290 TraceCheckUtils]: 306: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,541 INFO L290 TraceCheckUtils]: 307: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,541 INFO L290 TraceCheckUtils]: 308: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,541 INFO L290 TraceCheckUtils]: 309: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,541 INFO L290 TraceCheckUtils]: 310: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,542 INFO L290 TraceCheckUtils]: 311: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,542 INFO L290 TraceCheckUtils]: 312: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,542 INFO L290 TraceCheckUtils]: 313: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,542 INFO L290 TraceCheckUtils]: 314: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,543 INFO L290 TraceCheckUtils]: 315: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,543 INFO L290 TraceCheckUtils]: 316: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,543 INFO L290 TraceCheckUtils]: 317: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,543 INFO L290 TraceCheckUtils]: 318: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,544 INFO L290 TraceCheckUtils]: 319: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,544 INFO L290 TraceCheckUtils]: 320: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,544 INFO L290 TraceCheckUtils]: 321: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,544 INFO L290 TraceCheckUtils]: 322: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,545 INFO L290 TraceCheckUtils]: 323: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,545 INFO L290 TraceCheckUtils]: 324: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,545 INFO L290 TraceCheckUtils]: 325: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,545 INFO L290 TraceCheckUtils]: 326: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,546 INFO L290 TraceCheckUtils]: 327: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,546 INFO L290 TraceCheckUtils]: 328: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,546 INFO L290 TraceCheckUtils]: 329: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,546 INFO L290 TraceCheckUtils]: 330: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,546 INFO L290 TraceCheckUtils]: 331: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,547 INFO L290 TraceCheckUtils]: 332: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,547 INFO L290 TraceCheckUtils]: 333: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,547 INFO L290 TraceCheckUtils]: 334: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,547 INFO L290 TraceCheckUtils]: 335: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,548 INFO L290 TraceCheckUtils]: 336: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,548 INFO L290 TraceCheckUtils]: 337: Hoare triple {53667#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,548 INFO L290 TraceCheckUtils]: 338: Hoare triple {53667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {53667#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:01:58,548 INFO L290 TraceCheckUtils]: 339: Hoare triple {53667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:58,549 INFO L290 TraceCheckUtils]: 340: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:58,549 INFO L290 TraceCheckUtils]: 341: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:58,550 INFO L290 TraceCheckUtils]: 342: Hoare triple {54695#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:58,550 INFO L290 TraceCheckUtils]: 343: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:58,550 INFO L290 TraceCheckUtils]: 344: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:58,551 INFO L290 TraceCheckUtils]: 345: Hoare triple {54705#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:58,551 INFO L290 TraceCheckUtils]: 346: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:58,551 INFO L290 TraceCheckUtils]: 347: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:58,552 INFO L290 TraceCheckUtils]: 348: Hoare triple {54715#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:58,552 INFO L290 TraceCheckUtils]: 349: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:58,553 INFO L290 TraceCheckUtils]: 350: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:58,553 INFO L290 TraceCheckUtils]: 351: Hoare triple {54725#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-28 09:01:58,553 INFO L290 TraceCheckUtils]: 352: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-28 09:01:58,554 INFO L290 TraceCheckUtils]: 353: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-28 09:01:58,554 INFO L290 TraceCheckUtils]: 354: Hoare triple {54735#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54745#(and (<= main_~i~0 5) (<= 20 main_~edgecount~0))} is VALID [2022-04-28 09:01:58,554 INFO L290 TraceCheckUtils]: 355: Hoare triple {54745#(and (<= main_~i~0 5) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-28 09:01:58,554 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-28 09:01:58,554 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-28 09:01:58,554 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-28 09:01:58,555 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-28 09:01:58,555 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-28 09:01:58,555 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-28 09:01:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:58,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:59,666 INFO L290 TraceCheckUtils]: 361: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-04-28 09:01:59,666 INFO L290 TraceCheckUtils]: 360: Hoare triple {53663#false} assume 0 == ~cond; {53663#false} is VALID [2022-04-28 09:01:59,666 INFO L290 TraceCheckUtils]: 359: Hoare triple {53663#false} ~cond := #in~cond; {53663#false} is VALID [2022-04-28 09:01:59,666 INFO L272 TraceCheckUtils]: 358: Hoare triple {53663#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {53663#false} is VALID [2022-04-28 09:01:59,666 INFO L290 TraceCheckUtils]: 357: Hoare triple {53663#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {53663#false} is VALID [2022-04-28 09:01:59,667 INFO L290 TraceCheckUtils]: 356: Hoare triple {53663#false} ~i~0 := 0; {53663#false} is VALID [2022-04-28 09:01:59,667 INFO L290 TraceCheckUtils]: 355: Hoare triple {54785#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {53663#false} is VALID [2022-04-28 09:01:59,667 INFO L290 TraceCheckUtils]: 354: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54785#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,667 INFO L290 TraceCheckUtils]: 353: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,668 INFO L290 TraceCheckUtils]: 352: Hoare triple {54789#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,668 INFO L290 TraceCheckUtils]: 351: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54789#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,668 INFO L290 TraceCheckUtils]: 350: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,669 INFO L290 TraceCheckUtils]: 349: Hoare triple {54799#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,669 INFO L290 TraceCheckUtils]: 348: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54799#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,669 INFO L290 TraceCheckUtils]: 347: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,669 INFO L290 TraceCheckUtils]: 346: Hoare triple {54809#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,670 INFO L290 TraceCheckUtils]: 345: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54809#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,670 INFO L290 TraceCheckUtils]: 344: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,670 INFO L290 TraceCheckUtils]: 343: Hoare triple {54819#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,671 INFO L290 TraceCheckUtils]: 342: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {54819#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,671 INFO L290 TraceCheckUtils]: 341: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,671 INFO L290 TraceCheckUtils]: 340: Hoare triple {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,672 INFO L290 TraceCheckUtils]: 339: Hoare triple {54839#(< 5 main_~edgecount~0)} ~i~0 := 0; {54829#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:01:59,672 INFO L290 TraceCheckUtils]: 338: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,672 INFO L290 TraceCheckUtils]: 337: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,672 INFO L290 TraceCheckUtils]: 336: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,672 INFO L290 TraceCheckUtils]: 335: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,673 INFO L290 TraceCheckUtils]: 334: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,673 INFO L290 TraceCheckUtils]: 333: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,673 INFO L290 TraceCheckUtils]: 332: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,673 INFO L290 TraceCheckUtils]: 331: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,674 INFO L290 TraceCheckUtils]: 330: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,674 INFO L290 TraceCheckUtils]: 329: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,674 INFO L290 TraceCheckUtils]: 328: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,674 INFO L290 TraceCheckUtils]: 327: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,674 INFO L290 TraceCheckUtils]: 326: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,675 INFO L290 TraceCheckUtils]: 325: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,675 INFO L290 TraceCheckUtils]: 324: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,675 INFO L290 TraceCheckUtils]: 323: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,675 INFO L290 TraceCheckUtils]: 322: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,676 INFO L290 TraceCheckUtils]: 321: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,676 INFO L290 TraceCheckUtils]: 320: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,676 INFO L290 TraceCheckUtils]: 319: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,676 INFO L290 TraceCheckUtils]: 318: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,677 INFO L290 TraceCheckUtils]: 317: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,677 INFO L290 TraceCheckUtils]: 316: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,677 INFO L290 TraceCheckUtils]: 315: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,677 INFO L290 TraceCheckUtils]: 314: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,677 INFO L290 TraceCheckUtils]: 313: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,678 INFO L290 TraceCheckUtils]: 312: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,678 INFO L290 TraceCheckUtils]: 311: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,678 INFO L290 TraceCheckUtils]: 310: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,678 INFO L290 TraceCheckUtils]: 309: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,679 INFO L290 TraceCheckUtils]: 308: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,679 INFO L290 TraceCheckUtils]: 307: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,679 INFO L290 TraceCheckUtils]: 306: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,679 INFO L290 TraceCheckUtils]: 305: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,680 INFO L290 TraceCheckUtils]: 304: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,680 INFO L290 TraceCheckUtils]: 303: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,680 INFO L290 TraceCheckUtils]: 302: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,680 INFO L290 TraceCheckUtils]: 301: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,680 INFO L290 TraceCheckUtils]: 300: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,681 INFO L290 TraceCheckUtils]: 299: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,681 INFO L290 TraceCheckUtils]: 298: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,681 INFO L290 TraceCheckUtils]: 297: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,681 INFO L290 TraceCheckUtils]: 296: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,682 INFO L290 TraceCheckUtils]: 295: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,682 INFO L290 TraceCheckUtils]: 294: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,682 INFO L290 TraceCheckUtils]: 293: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,682 INFO L290 TraceCheckUtils]: 292: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,683 INFO L290 TraceCheckUtils]: 291: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,683 INFO L290 TraceCheckUtils]: 290: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,683 INFO L290 TraceCheckUtils]: 289: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,683 INFO L290 TraceCheckUtils]: 288: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,683 INFO L290 TraceCheckUtils]: 287: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,684 INFO L290 TraceCheckUtils]: 286: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,684 INFO L290 TraceCheckUtils]: 285: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,684 INFO L290 TraceCheckUtils]: 284: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,684 INFO L290 TraceCheckUtils]: 283: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,685 INFO L290 TraceCheckUtils]: 282: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,685 INFO L290 TraceCheckUtils]: 281: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,685 INFO L290 TraceCheckUtils]: 280: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,685 INFO L290 TraceCheckUtils]: 279: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,686 INFO L290 TraceCheckUtils]: 278: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,686 INFO L290 TraceCheckUtils]: 277: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,686 INFO L290 TraceCheckUtils]: 276: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,686 INFO L290 TraceCheckUtils]: 275: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,686 INFO L290 TraceCheckUtils]: 274: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,687 INFO L290 TraceCheckUtils]: 273: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,687 INFO L290 TraceCheckUtils]: 272: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,687 INFO L290 TraceCheckUtils]: 271: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,687 INFO L290 TraceCheckUtils]: 270: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 269: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 268: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 267: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 266: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,689 INFO L290 TraceCheckUtils]: 265: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,689 INFO L290 TraceCheckUtils]: 264: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,689 INFO L290 TraceCheckUtils]: 263: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,689 INFO L290 TraceCheckUtils]: 262: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,689 INFO L290 TraceCheckUtils]: 261: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 260: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 259: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 258: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 257: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,691 INFO L290 TraceCheckUtils]: 256: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,691 INFO L290 TraceCheckUtils]: 255: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,691 INFO L290 TraceCheckUtils]: 254: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,691 INFO L290 TraceCheckUtils]: 253: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 252: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 251: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 250: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 249: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 248: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,693 INFO L290 TraceCheckUtils]: 247: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,693 INFO L290 TraceCheckUtils]: 246: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,693 INFO L290 TraceCheckUtils]: 245: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,693 INFO L290 TraceCheckUtils]: 244: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,694 INFO L290 TraceCheckUtils]: 243: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,694 INFO L290 TraceCheckUtils]: 242: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,694 INFO L290 TraceCheckUtils]: 241: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,694 INFO L290 TraceCheckUtils]: 240: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,694 INFO L290 TraceCheckUtils]: 239: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,695 INFO L290 TraceCheckUtils]: 238: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,695 INFO L290 TraceCheckUtils]: 237: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,695 INFO L290 TraceCheckUtils]: 236: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,695 INFO L290 TraceCheckUtils]: 235: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,696 INFO L290 TraceCheckUtils]: 234: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,696 INFO L290 TraceCheckUtils]: 233: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,696 INFO L290 TraceCheckUtils]: 232: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,696 INFO L290 TraceCheckUtils]: 231: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,697 INFO L290 TraceCheckUtils]: 230: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,697 INFO L290 TraceCheckUtils]: 229: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,697 INFO L290 TraceCheckUtils]: 228: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,697 INFO L290 TraceCheckUtils]: 227: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,697 INFO L290 TraceCheckUtils]: 226: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,698 INFO L290 TraceCheckUtils]: 225: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,698 INFO L290 TraceCheckUtils]: 224: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,698 INFO L290 TraceCheckUtils]: 223: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,698 INFO L290 TraceCheckUtils]: 222: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,699 INFO L290 TraceCheckUtils]: 221: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,699 INFO L290 TraceCheckUtils]: 220: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,699 INFO L290 TraceCheckUtils]: 219: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,699 INFO L290 TraceCheckUtils]: 218: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,699 INFO L290 TraceCheckUtils]: 217: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,700 INFO L290 TraceCheckUtils]: 216: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,700 INFO L290 TraceCheckUtils]: 215: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,700 INFO L290 TraceCheckUtils]: 214: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,700 INFO L290 TraceCheckUtils]: 213: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,701 INFO L290 TraceCheckUtils]: 212: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,701 INFO L290 TraceCheckUtils]: 211: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,701 INFO L290 TraceCheckUtils]: 210: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,701 INFO L290 TraceCheckUtils]: 209: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,702 INFO L290 TraceCheckUtils]: 208: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,702 INFO L290 TraceCheckUtils]: 207: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,702 INFO L290 TraceCheckUtils]: 206: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,702 INFO L290 TraceCheckUtils]: 205: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,702 INFO L290 TraceCheckUtils]: 204: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,703 INFO L290 TraceCheckUtils]: 203: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,703 INFO L290 TraceCheckUtils]: 202: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,703 INFO L290 TraceCheckUtils]: 201: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,703 INFO L290 TraceCheckUtils]: 200: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,704 INFO L290 TraceCheckUtils]: 199: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,704 INFO L290 TraceCheckUtils]: 198: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,704 INFO L290 TraceCheckUtils]: 197: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,704 INFO L290 TraceCheckUtils]: 196: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,705 INFO L290 TraceCheckUtils]: 195: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,705 INFO L290 TraceCheckUtils]: 194: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,705 INFO L290 TraceCheckUtils]: 193: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,705 INFO L290 TraceCheckUtils]: 192: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,705 INFO L290 TraceCheckUtils]: 191: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,706 INFO L290 TraceCheckUtils]: 190: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,706 INFO L290 TraceCheckUtils]: 189: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,706 INFO L290 TraceCheckUtils]: 188: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,706 INFO L290 TraceCheckUtils]: 187: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,707 INFO L290 TraceCheckUtils]: 186: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,707 INFO L290 TraceCheckUtils]: 185: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,707 INFO L290 TraceCheckUtils]: 184: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,707 INFO L290 TraceCheckUtils]: 183: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,707 INFO L290 TraceCheckUtils]: 182: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,708 INFO L290 TraceCheckUtils]: 181: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,708 INFO L290 TraceCheckUtils]: 180: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,708 INFO L290 TraceCheckUtils]: 179: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,708 INFO L290 TraceCheckUtils]: 178: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,709 INFO L290 TraceCheckUtils]: 177: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,709 INFO L290 TraceCheckUtils]: 176: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,709 INFO L290 TraceCheckUtils]: 175: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,709 INFO L290 TraceCheckUtils]: 174: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,710 INFO L290 TraceCheckUtils]: 173: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,710 INFO L290 TraceCheckUtils]: 172: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,710 INFO L290 TraceCheckUtils]: 171: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,710 INFO L290 TraceCheckUtils]: 170: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,710 INFO L290 TraceCheckUtils]: 169: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,711 INFO L290 TraceCheckUtils]: 168: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,711 INFO L290 TraceCheckUtils]: 167: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,711 INFO L290 TraceCheckUtils]: 166: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,711 INFO L290 TraceCheckUtils]: 165: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,712 INFO L290 TraceCheckUtils]: 164: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,712 INFO L290 TraceCheckUtils]: 163: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,712 INFO L290 TraceCheckUtils]: 162: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,712 INFO L290 TraceCheckUtils]: 161: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,713 INFO L290 TraceCheckUtils]: 160: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,713 INFO L290 TraceCheckUtils]: 159: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,713 INFO L290 TraceCheckUtils]: 158: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,713 INFO L290 TraceCheckUtils]: 157: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,713 INFO L290 TraceCheckUtils]: 156: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,714 INFO L290 TraceCheckUtils]: 155: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,714 INFO L290 TraceCheckUtils]: 154: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,714 INFO L290 TraceCheckUtils]: 153: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,714 INFO L290 TraceCheckUtils]: 152: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,715 INFO L290 TraceCheckUtils]: 151: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,715 INFO L290 TraceCheckUtils]: 150: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,715 INFO L290 TraceCheckUtils]: 149: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,715 INFO L290 TraceCheckUtils]: 148: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,716 INFO L290 TraceCheckUtils]: 147: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,716 INFO L290 TraceCheckUtils]: 146: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,716 INFO L290 TraceCheckUtils]: 145: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,716 INFO L290 TraceCheckUtils]: 144: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,716 INFO L290 TraceCheckUtils]: 143: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,717 INFO L290 TraceCheckUtils]: 142: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,717 INFO L290 TraceCheckUtils]: 141: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,717 INFO L290 TraceCheckUtils]: 140: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,717 INFO L290 TraceCheckUtils]: 139: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,718 INFO L290 TraceCheckUtils]: 138: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,718 INFO L290 TraceCheckUtils]: 137: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,718 INFO L290 TraceCheckUtils]: 136: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,718 INFO L290 TraceCheckUtils]: 135: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,718 INFO L290 TraceCheckUtils]: 134: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,719 INFO L290 TraceCheckUtils]: 133: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,719 INFO L290 TraceCheckUtils]: 132: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,719 INFO L290 TraceCheckUtils]: 131: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,719 INFO L290 TraceCheckUtils]: 130: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,720 INFO L290 TraceCheckUtils]: 129: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,720 INFO L290 TraceCheckUtils]: 128: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,720 INFO L290 TraceCheckUtils]: 127: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,720 INFO L290 TraceCheckUtils]: 126: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,721 INFO L290 TraceCheckUtils]: 125: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,721 INFO L290 TraceCheckUtils]: 124: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,721 INFO L290 TraceCheckUtils]: 123: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,721 INFO L290 TraceCheckUtils]: 122: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,721 INFO L290 TraceCheckUtils]: 121: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,722 INFO L290 TraceCheckUtils]: 120: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,722 INFO L290 TraceCheckUtils]: 119: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,722 INFO L290 TraceCheckUtils]: 118: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,723 INFO L290 TraceCheckUtils]: 117: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,723 INFO L290 TraceCheckUtils]: 116: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,723 INFO L290 TraceCheckUtils]: 115: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,723 INFO L290 TraceCheckUtils]: 114: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,724 INFO L290 TraceCheckUtils]: 113: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,724 INFO L290 TraceCheckUtils]: 112: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,724 INFO L290 TraceCheckUtils]: 111: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,724 INFO L290 TraceCheckUtils]: 110: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,725 INFO L290 TraceCheckUtils]: 109: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,725 INFO L290 TraceCheckUtils]: 108: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,725 INFO L290 TraceCheckUtils]: 107: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,725 INFO L290 TraceCheckUtils]: 106: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,726 INFO L290 TraceCheckUtils]: 105: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,726 INFO L290 TraceCheckUtils]: 104: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,726 INFO L290 TraceCheckUtils]: 103: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,726 INFO L290 TraceCheckUtils]: 102: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,726 INFO L290 TraceCheckUtils]: 101: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,727 INFO L290 TraceCheckUtils]: 100: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,727 INFO L290 TraceCheckUtils]: 99: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,727 INFO L290 TraceCheckUtils]: 98: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,728 INFO L290 TraceCheckUtils]: 97: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,728 INFO L290 TraceCheckUtils]: 96: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,728 INFO L290 TraceCheckUtils]: 95: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,728 INFO L290 TraceCheckUtils]: 94: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,729 INFO L290 TraceCheckUtils]: 93: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,729 INFO L290 TraceCheckUtils]: 92: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,729 INFO L290 TraceCheckUtils]: 91: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,729 INFO L290 TraceCheckUtils]: 90: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,730 INFO L290 TraceCheckUtils]: 89: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,730 INFO L290 TraceCheckUtils]: 87: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,730 INFO L290 TraceCheckUtils]: 86: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,731 INFO L290 TraceCheckUtils]: 83: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,733 INFO L290 TraceCheckUtils]: 73: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,735 INFO L290 TraceCheckUtils]: 66: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,735 INFO L290 TraceCheckUtils]: 65: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,737 INFO L290 TraceCheckUtils]: 59: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,737 INFO L290 TraceCheckUtils]: 58: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,737 INFO L290 TraceCheckUtils]: 57: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {54839#(< 5 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {54839#(< 5 main_~edgecount~0)} ~i~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {54839#(< 5 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {54839#(< 5 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {54839#(< 5 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {54839#(< 5 main_~edgecount~0)} is VALID [2022-04-28 09:01:59,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {53662#true} call #t~ret22 := main(); {53662#true} is VALID [2022-04-28 09:01:59,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53662#true} {53662#true} #107#return; {53662#true} is VALID [2022-04-28 09:01:59,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume true; {53662#true} is VALID [2022-04-28 09:01:59,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {53662#true} is VALID [2022-04-28 09:01:59,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {53662#true} call ULTIMATE.init(); {53662#true} is VALID [2022-04-28 09:01:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15455 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:01:59,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272237842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:59,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:59,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-28 09:01:59,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:59,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032867287] [2022-04-28 09:01:59,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032867287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:59,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:59,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:01:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646500943] [2022-04-28 09:01:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:59,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 362 [2022-04-28 09:01:59,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:59,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:59,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:59,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:01:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:01:59,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=305, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:01:59,794 INFO L87 Difference]: Start difference. First operand 367 states and 476 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:02,507 INFO L93 Difference]: Finished difference Result 539 states and 699 transitions. [2022-04-28 09:02:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:02:02,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 362 [2022-04-28 09:02:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-28 09:02:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-04-28 09:02:02,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 160 transitions. [2022-04-28 09:02:02,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:02,634 INFO L225 Difference]: With dead ends: 539 [2022-04-28 09:02:02,634 INFO L226 Difference]: Without dead ends: 528 [2022-04-28 09:02:02,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:02:02,635 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 242 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:02,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 47 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:02:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-04-28 09:02:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 370. [2022-04-28 09:02:04,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:04,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:04,123 INFO L74 IsIncluded]: Start isIncluded. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:04,123 INFO L87 Difference]: Start difference. First operand 528 states. Second operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:04,134 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-28 09:02:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-28 09:02:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:04,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 528 states. [2022-04-28 09:02:04,134 INFO L87 Difference]: Start difference. First operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 528 states. [2022-04-28 09:02:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:04,144 INFO L93 Difference]: Finished difference Result 528 states and 687 transitions. [2022-04-28 09:02:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2022-04-28 09:02:04,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:04,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:04,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:04,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 364 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 479 transitions. [2022-04-28 09:02:04,150 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 479 transitions. Word has length 362 [2022-04-28 09:02:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:04,151 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 479 transitions. [2022-04-28 09:02:04,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:04,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 479 transitions. [2022-04-28 09:02:04,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 479 transitions. [2022-04-28 09:02:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2022-04-28 09:02:04,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:04,934 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 6, 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] [2022-04-28 09:02:04,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 09:02:05,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 09:02:05,135 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 63 times [2022-04-28 09:02:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:05,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117057058] [2022-04-28 09:02:05,138 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:02:05,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash 952532282, now seen corresponding path program 64 times [2022-04-28 09:02:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:05,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982314756] [2022-04-28 09:02:05,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-28 09:02:05,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-28 09:02:05,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-28 09:02:05,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:05,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {58760#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-28 09:02:05,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-28 09:02:05,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-28 09:02:05,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-28 09:02:05,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,471 INFO L290 TraceCheckUtils]: 83: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,472 INFO L290 TraceCheckUtils]: 86: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,472 INFO L290 TraceCheckUtils]: 87: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,473 INFO L290 TraceCheckUtils]: 88: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,473 INFO L290 TraceCheckUtils]: 89: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,473 INFO L290 TraceCheckUtils]: 90: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,473 INFO L290 TraceCheckUtils]: 91: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,474 INFO L290 TraceCheckUtils]: 95: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,475 INFO L290 TraceCheckUtils]: 96: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,475 INFO L290 TraceCheckUtils]: 97: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,475 INFO L290 TraceCheckUtils]: 98: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,475 INFO L290 TraceCheckUtils]: 99: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,476 INFO L290 TraceCheckUtils]: 101: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,476 INFO L290 TraceCheckUtils]: 103: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,477 INFO L290 TraceCheckUtils]: 104: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,477 INFO L290 TraceCheckUtils]: 105: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,477 INFO L290 TraceCheckUtils]: 107: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,478 INFO L290 TraceCheckUtils]: 108: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,478 INFO L290 TraceCheckUtils]: 109: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,478 INFO L290 TraceCheckUtils]: 110: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,478 INFO L290 TraceCheckUtils]: 111: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,479 INFO L290 TraceCheckUtils]: 112: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,479 INFO L290 TraceCheckUtils]: 113: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,479 INFO L290 TraceCheckUtils]: 114: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,479 INFO L290 TraceCheckUtils]: 115: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,480 INFO L290 TraceCheckUtils]: 116: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,480 INFO L290 TraceCheckUtils]: 117: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,480 INFO L290 TraceCheckUtils]: 118: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,480 INFO L290 TraceCheckUtils]: 119: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,480 INFO L290 TraceCheckUtils]: 120: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,481 INFO L290 TraceCheckUtils]: 121: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,481 INFO L290 TraceCheckUtils]: 122: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,481 INFO L290 TraceCheckUtils]: 123: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,481 INFO L290 TraceCheckUtils]: 124: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,482 INFO L290 TraceCheckUtils]: 125: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,482 INFO L290 TraceCheckUtils]: 126: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,482 INFO L290 TraceCheckUtils]: 127: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,482 INFO L290 TraceCheckUtils]: 128: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,483 INFO L290 TraceCheckUtils]: 129: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,483 INFO L290 TraceCheckUtils]: 130: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,483 INFO L290 TraceCheckUtils]: 131: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,483 INFO L290 TraceCheckUtils]: 132: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,484 INFO L290 TraceCheckUtils]: 133: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,484 INFO L290 TraceCheckUtils]: 134: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,484 INFO L290 TraceCheckUtils]: 135: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,484 INFO L290 TraceCheckUtils]: 136: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,484 INFO L290 TraceCheckUtils]: 137: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,485 INFO L290 TraceCheckUtils]: 138: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,485 INFO L290 TraceCheckUtils]: 139: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,485 INFO L290 TraceCheckUtils]: 140: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,485 INFO L290 TraceCheckUtils]: 141: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,486 INFO L290 TraceCheckUtils]: 142: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,486 INFO L290 TraceCheckUtils]: 143: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,486 INFO L290 TraceCheckUtils]: 144: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,486 INFO L290 TraceCheckUtils]: 145: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,486 INFO L290 TraceCheckUtils]: 146: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,487 INFO L290 TraceCheckUtils]: 147: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,487 INFO L290 TraceCheckUtils]: 148: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,487 INFO L290 TraceCheckUtils]: 149: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,487 INFO L290 TraceCheckUtils]: 150: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,487 INFO L290 TraceCheckUtils]: 151: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,488 INFO L290 TraceCheckUtils]: 152: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,488 INFO L290 TraceCheckUtils]: 153: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,488 INFO L290 TraceCheckUtils]: 154: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,488 INFO L290 TraceCheckUtils]: 155: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,489 INFO L290 TraceCheckUtils]: 156: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,489 INFO L290 TraceCheckUtils]: 157: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,489 INFO L290 TraceCheckUtils]: 158: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,489 INFO L290 TraceCheckUtils]: 159: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,489 INFO L290 TraceCheckUtils]: 160: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,490 INFO L290 TraceCheckUtils]: 161: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,490 INFO L290 TraceCheckUtils]: 162: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,490 INFO L290 TraceCheckUtils]: 163: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,490 INFO L290 TraceCheckUtils]: 164: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,491 INFO L290 TraceCheckUtils]: 165: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,491 INFO L290 TraceCheckUtils]: 166: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,491 INFO L290 TraceCheckUtils]: 167: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,491 INFO L290 TraceCheckUtils]: 168: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,491 INFO L290 TraceCheckUtils]: 169: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,492 INFO L290 TraceCheckUtils]: 170: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,492 INFO L290 TraceCheckUtils]: 171: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,492 INFO L290 TraceCheckUtils]: 172: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,492 INFO L290 TraceCheckUtils]: 173: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,492 INFO L290 TraceCheckUtils]: 174: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,493 INFO L290 TraceCheckUtils]: 175: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,493 INFO L290 TraceCheckUtils]: 176: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,493 INFO L290 TraceCheckUtils]: 177: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,493 INFO L290 TraceCheckUtils]: 178: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,494 INFO L290 TraceCheckUtils]: 179: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,494 INFO L290 TraceCheckUtils]: 180: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,494 INFO L290 TraceCheckUtils]: 181: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,494 INFO L290 TraceCheckUtils]: 182: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,494 INFO L290 TraceCheckUtils]: 183: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,495 INFO L290 TraceCheckUtils]: 184: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,495 INFO L290 TraceCheckUtils]: 185: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,495 INFO L290 TraceCheckUtils]: 186: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,495 INFO L290 TraceCheckUtils]: 187: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,495 INFO L290 TraceCheckUtils]: 188: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,496 INFO L290 TraceCheckUtils]: 189: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,496 INFO L290 TraceCheckUtils]: 190: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,496 INFO L290 TraceCheckUtils]: 191: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,496 INFO L290 TraceCheckUtils]: 192: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,497 INFO L290 TraceCheckUtils]: 193: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,497 INFO L290 TraceCheckUtils]: 194: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,497 INFO L290 TraceCheckUtils]: 195: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,497 INFO L290 TraceCheckUtils]: 196: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,497 INFO L290 TraceCheckUtils]: 197: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,498 INFO L290 TraceCheckUtils]: 198: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,498 INFO L290 TraceCheckUtils]: 199: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,498 INFO L290 TraceCheckUtils]: 200: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,498 INFO L290 TraceCheckUtils]: 201: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,498 INFO L290 TraceCheckUtils]: 202: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,499 INFO L290 TraceCheckUtils]: 203: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,499 INFO L290 TraceCheckUtils]: 204: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,499 INFO L290 TraceCheckUtils]: 205: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,499 INFO L290 TraceCheckUtils]: 206: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,500 INFO L290 TraceCheckUtils]: 207: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,500 INFO L290 TraceCheckUtils]: 208: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,500 INFO L290 TraceCheckUtils]: 209: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,500 INFO L290 TraceCheckUtils]: 210: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,500 INFO L290 TraceCheckUtils]: 211: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,501 INFO L290 TraceCheckUtils]: 212: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,501 INFO L290 TraceCheckUtils]: 213: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,501 INFO L290 TraceCheckUtils]: 214: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,501 INFO L290 TraceCheckUtils]: 215: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,501 INFO L290 TraceCheckUtils]: 216: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,502 INFO L290 TraceCheckUtils]: 217: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,502 INFO L290 TraceCheckUtils]: 218: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,502 INFO L290 TraceCheckUtils]: 219: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,502 INFO L290 TraceCheckUtils]: 220: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,503 INFO L290 TraceCheckUtils]: 221: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,503 INFO L290 TraceCheckUtils]: 222: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,503 INFO L290 TraceCheckUtils]: 223: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,503 INFO L290 TraceCheckUtils]: 224: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,503 INFO L290 TraceCheckUtils]: 225: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,504 INFO L290 TraceCheckUtils]: 226: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,504 INFO L290 TraceCheckUtils]: 227: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,504 INFO L290 TraceCheckUtils]: 228: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,504 INFO L290 TraceCheckUtils]: 229: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,504 INFO L290 TraceCheckUtils]: 230: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,505 INFO L290 TraceCheckUtils]: 231: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,505 INFO L290 TraceCheckUtils]: 232: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,505 INFO L290 TraceCheckUtils]: 233: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,505 INFO L290 TraceCheckUtils]: 234: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,505 INFO L290 TraceCheckUtils]: 235: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,506 INFO L290 TraceCheckUtils]: 236: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,506 INFO L290 TraceCheckUtils]: 237: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,506 INFO L290 TraceCheckUtils]: 238: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,506 INFO L290 TraceCheckUtils]: 239: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,506 INFO L290 TraceCheckUtils]: 240: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,507 INFO L290 TraceCheckUtils]: 241: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,507 INFO L290 TraceCheckUtils]: 242: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,507 INFO L290 TraceCheckUtils]: 243: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,507 INFO L290 TraceCheckUtils]: 244: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,507 INFO L290 TraceCheckUtils]: 245: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,508 INFO L290 TraceCheckUtils]: 246: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,508 INFO L290 TraceCheckUtils]: 247: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,508 INFO L290 TraceCheckUtils]: 248: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,508 INFO L290 TraceCheckUtils]: 249: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,508 INFO L290 TraceCheckUtils]: 250: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,509 INFO L290 TraceCheckUtils]: 251: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,509 INFO L290 TraceCheckUtils]: 252: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,509 INFO L290 TraceCheckUtils]: 253: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,509 INFO L290 TraceCheckUtils]: 254: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,509 INFO L290 TraceCheckUtils]: 255: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,510 INFO L290 TraceCheckUtils]: 256: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,510 INFO L290 TraceCheckUtils]: 257: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,510 INFO L290 TraceCheckUtils]: 258: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,510 INFO L290 TraceCheckUtils]: 259: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,510 INFO L290 TraceCheckUtils]: 260: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,511 INFO L290 TraceCheckUtils]: 261: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,511 INFO L290 TraceCheckUtils]: 262: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,511 INFO L290 TraceCheckUtils]: 263: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,511 INFO L290 TraceCheckUtils]: 264: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,511 INFO L290 TraceCheckUtils]: 265: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,512 INFO L290 TraceCheckUtils]: 266: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,512 INFO L290 TraceCheckUtils]: 267: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,512 INFO L290 TraceCheckUtils]: 268: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,512 INFO L290 TraceCheckUtils]: 269: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,512 INFO L290 TraceCheckUtils]: 270: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,513 INFO L290 TraceCheckUtils]: 271: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,513 INFO L290 TraceCheckUtils]: 272: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,513 INFO L290 TraceCheckUtils]: 273: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,513 INFO L290 TraceCheckUtils]: 274: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,513 INFO L290 TraceCheckUtils]: 275: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,514 INFO L290 TraceCheckUtils]: 276: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,514 INFO L290 TraceCheckUtils]: 277: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,514 INFO L290 TraceCheckUtils]: 278: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,514 INFO L290 TraceCheckUtils]: 279: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,514 INFO L290 TraceCheckUtils]: 280: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,515 INFO L290 TraceCheckUtils]: 281: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,515 INFO L290 TraceCheckUtils]: 282: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,515 INFO L290 TraceCheckUtils]: 283: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,515 INFO L290 TraceCheckUtils]: 284: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,515 INFO L290 TraceCheckUtils]: 285: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,516 INFO L290 TraceCheckUtils]: 286: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,516 INFO L290 TraceCheckUtils]: 287: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,516 INFO L290 TraceCheckUtils]: 288: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,516 INFO L290 TraceCheckUtils]: 289: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,516 INFO L290 TraceCheckUtils]: 290: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,517 INFO L290 TraceCheckUtils]: 291: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,517 INFO L290 TraceCheckUtils]: 292: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,517 INFO L290 TraceCheckUtils]: 293: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,517 INFO L290 TraceCheckUtils]: 294: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,517 INFO L290 TraceCheckUtils]: 295: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,518 INFO L290 TraceCheckUtils]: 296: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,518 INFO L290 TraceCheckUtils]: 297: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,518 INFO L290 TraceCheckUtils]: 298: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,518 INFO L290 TraceCheckUtils]: 299: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,519 INFO L290 TraceCheckUtils]: 300: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,519 INFO L290 TraceCheckUtils]: 301: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,519 INFO L290 TraceCheckUtils]: 302: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,519 INFO L290 TraceCheckUtils]: 303: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,519 INFO L290 TraceCheckUtils]: 304: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,520 INFO L290 TraceCheckUtils]: 305: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,520 INFO L290 TraceCheckUtils]: 306: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,520 INFO L290 TraceCheckUtils]: 307: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,520 INFO L290 TraceCheckUtils]: 308: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,520 INFO L290 TraceCheckUtils]: 309: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,521 INFO L290 TraceCheckUtils]: 310: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,521 INFO L290 TraceCheckUtils]: 311: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,521 INFO L290 TraceCheckUtils]: 312: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,521 INFO L290 TraceCheckUtils]: 313: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,522 INFO L290 TraceCheckUtils]: 314: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,522 INFO L290 TraceCheckUtils]: 315: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,522 INFO L290 TraceCheckUtils]: 316: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,522 INFO L290 TraceCheckUtils]: 317: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,523 INFO L290 TraceCheckUtils]: 318: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,523 INFO L290 TraceCheckUtils]: 319: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,523 INFO L290 TraceCheckUtils]: 320: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,523 INFO L290 TraceCheckUtils]: 321: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,523 INFO L290 TraceCheckUtils]: 322: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,524 INFO L290 TraceCheckUtils]: 323: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,524 INFO L290 TraceCheckUtils]: 324: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,524 INFO L290 TraceCheckUtils]: 325: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,524 INFO L290 TraceCheckUtils]: 326: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,525 INFO L290 TraceCheckUtils]: 327: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,525 INFO L290 TraceCheckUtils]: 328: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,525 INFO L290 TraceCheckUtils]: 329: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,525 INFO L290 TraceCheckUtils]: 330: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,526 INFO L290 TraceCheckUtils]: 331: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,526 INFO L290 TraceCheckUtils]: 332: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,526 INFO L290 TraceCheckUtils]: 333: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,526 INFO L290 TraceCheckUtils]: 334: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,527 INFO L290 TraceCheckUtils]: 335: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,527 INFO L290 TraceCheckUtils]: 336: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~j~0 < ~edgecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,527 INFO L290 TraceCheckUtils]: 337: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,527 INFO L290 TraceCheckUtils]: 338: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {58752#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-28 09:02:05,528 INFO L290 TraceCheckUtils]: 339: Hoare triple {58752#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:02:05,528 INFO L290 TraceCheckUtils]: 340: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:02:05,528 INFO L290 TraceCheckUtils]: 341: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:02:05,529 INFO L290 TraceCheckUtils]: 342: Hoare triple {58753#(and (= (+ (- 20) main_~edgecount~0) 0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:02:05,529 INFO L290 TraceCheckUtils]: 343: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:02:05,529 INFO L290 TraceCheckUtils]: 344: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:02:05,530 INFO L290 TraceCheckUtils]: 345: Hoare triple {58754#(and (<= main_~i~0 1) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:02:05,530 INFO L290 TraceCheckUtils]: 346: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:02:05,531 INFO L290 TraceCheckUtils]: 347: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} is VALID [2022-04-28 09:02:05,531 INFO L290 TraceCheckUtils]: 348: Hoare triple {58755#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:02:05,531 INFO L290 TraceCheckUtils]: 349: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:02:05,532 INFO L290 TraceCheckUtils]: 350: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} is VALID [2022-04-28 09:02:05,532 INFO L290 TraceCheckUtils]: 351: Hoare triple {58756#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-28 09:02:05,532 INFO L290 TraceCheckUtils]: 352: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-28 09:02:05,533 INFO L290 TraceCheckUtils]: 353: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} is VALID [2022-04-28 09:02:05,533 INFO L290 TraceCheckUtils]: 354: Hoare triple {58757#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:02:05,534 INFO L290 TraceCheckUtils]: 355: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:02:05,534 INFO L290 TraceCheckUtils]: 356: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-28 09:02:05,534 INFO L290 TraceCheckUtils]: 357: Hoare triple {58758#(and (<= main_~i~0 5) (= (+ (- 20) main_~edgecount~0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {58759#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 6))} is VALID [2022-04-28 09:02:05,535 INFO L290 TraceCheckUtils]: 358: Hoare triple {58759#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~i~0 6))} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-28 09:02:05,535 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-28 09:02:05,535 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-28 09:02:05,535 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-28 09:02:05,535 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-28 09:02:05,535 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-28 09:02:05,535 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-28 09:02:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:02:05,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982314756] [2022-04-28 09:02:05,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982314756] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880601261] [2022-04-28 09:02:05,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:02:05,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:05,537 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:02:05,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 09:02:06,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:02:06,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:06,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 09:02:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:07,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {58747#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:07,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-28 09:02:07,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {58833#(<= 0 main_~j~0)} is VALID [2022-04-28 09:02:07,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {58833#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58833#(<= 0 main_~j~0)} is VALID [2022-04-28 09:02:07,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {58833#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58833#(<= 0 main_~j~0)} is VALID [2022-04-28 09:02:07,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {58833#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58843#(<= 1 main_~j~0)} is VALID [2022-04-28 09:02:07,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {58843#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58843#(<= 1 main_~j~0)} is VALID [2022-04-28 09:02:07,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {58843#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58843#(<= 1 main_~j~0)} is VALID [2022-04-28 09:02:07,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {58843#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58853#(<= 2 main_~j~0)} is VALID [2022-04-28 09:02:07,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {58853#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58853#(<= 2 main_~j~0)} is VALID [2022-04-28 09:02:07,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {58853#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58853#(<= 2 main_~j~0)} is VALID [2022-04-28 09:02:07,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {58853#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58863#(<= 3 main_~j~0)} is VALID [2022-04-28 09:02:07,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {58863#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58863#(<= 3 main_~j~0)} is VALID [2022-04-28 09:02:07,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {58863#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58863#(<= 3 main_~j~0)} is VALID [2022-04-28 09:02:07,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {58863#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58873#(<= 4 main_~j~0)} is VALID [2022-04-28 09:02:07,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {58873#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58873#(<= 4 main_~j~0)} is VALID [2022-04-28 09:02:07,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {58873#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58873#(<= 4 main_~j~0)} is VALID [2022-04-28 09:02:07,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {58873#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58883#(<= 5 main_~j~0)} is VALID [2022-04-28 09:02:07,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {58883#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58883#(<= 5 main_~j~0)} is VALID [2022-04-28 09:02:07,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {58883#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58883#(<= 5 main_~j~0)} is VALID [2022-04-28 09:02:07,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {58883#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58893#(<= 6 main_~j~0)} is VALID [2022-04-28 09:02:07,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {58893#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58893#(<= 6 main_~j~0)} is VALID [2022-04-28 09:02:07,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {58893#(<= 6 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58893#(<= 6 main_~j~0)} is VALID [2022-04-28 09:02:07,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {58893#(<= 6 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58903#(<= 7 main_~j~0)} is VALID [2022-04-28 09:02:07,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {58903#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58903#(<= 7 main_~j~0)} is VALID [2022-04-28 09:02:07,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {58903#(<= 7 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58903#(<= 7 main_~j~0)} is VALID [2022-04-28 09:02:07,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {58903#(<= 7 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58913#(<= 8 main_~j~0)} is VALID [2022-04-28 09:02:07,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {58913#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58913#(<= 8 main_~j~0)} is VALID [2022-04-28 09:02:07,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {58913#(<= 8 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58913#(<= 8 main_~j~0)} is VALID [2022-04-28 09:02:07,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {58913#(<= 8 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58923#(<= 9 main_~j~0)} is VALID [2022-04-28 09:02:07,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {58923#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58923#(<= 9 main_~j~0)} is VALID [2022-04-28 09:02:07,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {58923#(<= 9 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58923#(<= 9 main_~j~0)} is VALID [2022-04-28 09:02:07,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {58923#(<= 9 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58933#(<= 10 main_~j~0)} is VALID [2022-04-28 09:02:07,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {58933#(<= 10 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58933#(<= 10 main_~j~0)} is VALID [2022-04-28 09:02:07,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {58933#(<= 10 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58933#(<= 10 main_~j~0)} is VALID [2022-04-28 09:02:07,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {58933#(<= 10 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58943#(<= 11 main_~j~0)} is VALID [2022-04-28 09:02:07,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {58943#(<= 11 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58943#(<= 11 main_~j~0)} is VALID [2022-04-28 09:02:07,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {58943#(<= 11 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58943#(<= 11 main_~j~0)} is VALID [2022-04-28 09:02:07,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {58943#(<= 11 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58953#(<= 12 main_~j~0)} is VALID [2022-04-28 09:02:07,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {58953#(<= 12 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58953#(<= 12 main_~j~0)} is VALID [2022-04-28 09:02:07,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {58953#(<= 12 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58953#(<= 12 main_~j~0)} is VALID [2022-04-28 09:02:07,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {58953#(<= 12 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58963#(<= 13 main_~j~0)} is VALID [2022-04-28 09:02:07,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {58963#(<= 13 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58963#(<= 13 main_~j~0)} is VALID [2022-04-28 09:02:07,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {58963#(<= 13 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58963#(<= 13 main_~j~0)} is VALID [2022-04-28 09:02:07,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {58963#(<= 13 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58973#(<= 14 main_~j~0)} is VALID [2022-04-28 09:02:07,573 INFO L290 TraceCheckUtils]: 66: Hoare triple {58973#(<= 14 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58973#(<= 14 main_~j~0)} is VALID [2022-04-28 09:02:07,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {58973#(<= 14 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58973#(<= 14 main_~j~0)} is VALID [2022-04-28 09:02:07,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {58973#(<= 14 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58983#(<= 15 main_~j~0)} is VALID [2022-04-28 09:02:07,573 INFO L290 TraceCheckUtils]: 69: Hoare triple {58983#(<= 15 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58983#(<= 15 main_~j~0)} is VALID [2022-04-28 09:02:07,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {58983#(<= 15 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58983#(<= 15 main_~j~0)} is VALID [2022-04-28 09:02:07,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {58983#(<= 15 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58993#(<= 16 main_~j~0)} is VALID [2022-04-28 09:02:07,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {58993#(<= 16 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58993#(<= 16 main_~j~0)} is VALID [2022-04-28 09:02:07,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {58993#(<= 16 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58993#(<= 16 main_~j~0)} is VALID [2022-04-28 09:02:07,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {58993#(<= 16 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59003#(<= 17 main_~j~0)} is VALID [2022-04-28 09:02:07,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {59003#(<= 17 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59003#(<= 17 main_~j~0)} is VALID [2022-04-28 09:02:07,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {59003#(<= 17 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59003#(<= 17 main_~j~0)} is VALID [2022-04-28 09:02:07,576 INFO L290 TraceCheckUtils]: 77: Hoare triple {59003#(<= 17 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59013#(<= 18 main_~j~0)} is VALID [2022-04-28 09:02:07,576 INFO L290 TraceCheckUtils]: 78: Hoare triple {59013#(<= 18 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59013#(<= 18 main_~j~0)} is VALID [2022-04-28 09:02:07,576 INFO L290 TraceCheckUtils]: 79: Hoare triple {59013#(<= 18 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59013#(<= 18 main_~j~0)} is VALID [2022-04-28 09:02:07,576 INFO L290 TraceCheckUtils]: 80: Hoare triple {59013#(<= 18 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59023#(<= 19 main_~j~0)} is VALID [2022-04-28 09:02:07,577 INFO L290 TraceCheckUtils]: 81: Hoare triple {59023#(<= 19 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,577 INFO L290 TraceCheckUtils]: 82: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,577 INFO L290 TraceCheckUtils]: 83: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,578 INFO L290 TraceCheckUtils]: 86: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,578 INFO L290 TraceCheckUtils]: 87: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,579 INFO L290 TraceCheckUtils]: 89: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,579 INFO L290 TraceCheckUtils]: 90: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,579 INFO L290 TraceCheckUtils]: 91: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,579 INFO L290 TraceCheckUtils]: 92: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,580 INFO L290 TraceCheckUtils]: 93: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,580 INFO L290 TraceCheckUtils]: 94: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,580 INFO L290 TraceCheckUtils]: 95: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,580 INFO L290 TraceCheckUtils]: 96: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,581 INFO L290 TraceCheckUtils]: 97: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,581 INFO L290 TraceCheckUtils]: 98: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,581 INFO L290 TraceCheckUtils]: 99: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,581 INFO L290 TraceCheckUtils]: 101: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,582 INFO L290 TraceCheckUtils]: 103: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,582 INFO L290 TraceCheckUtils]: 104: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,582 INFO L290 TraceCheckUtils]: 105: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,583 INFO L290 TraceCheckUtils]: 106: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,583 INFO L290 TraceCheckUtils]: 107: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,583 INFO L290 TraceCheckUtils]: 108: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,583 INFO L290 TraceCheckUtils]: 109: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,583 INFO L290 TraceCheckUtils]: 110: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,584 INFO L290 TraceCheckUtils]: 111: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,584 INFO L290 TraceCheckUtils]: 112: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,584 INFO L290 TraceCheckUtils]: 113: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,584 INFO L290 TraceCheckUtils]: 114: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,585 INFO L290 TraceCheckUtils]: 115: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,585 INFO L290 TraceCheckUtils]: 116: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,585 INFO L290 TraceCheckUtils]: 117: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,585 INFO L290 TraceCheckUtils]: 118: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,586 INFO L290 TraceCheckUtils]: 119: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,586 INFO L290 TraceCheckUtils]: 120: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,586 INFO L290 TraceCheckUtils]: 121: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,586 INFO L290 TraceCheckUtils]: 122: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,586 INFO L290 TraceCheckUtils]: 123: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,587 INFO L290 TraceCheckUtils]: 124: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,587 INFO L290 TraceCheckUtils]: 125: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,587 INFO L290 TraceCheckUtils]: 126: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,587 INFO L290 TraceCheckUtils]: 127: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,588 INFO L290 TraceCheckUtils]: 128: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,588 INFO L290 TraceCheckUtils]: 129: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,588 INFO L290 TraceCheckUtils]: 130: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,588 INFO L290 TraceCheckUtils]: 131: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,589 INFO L290 TraceCheckUtils]: 132: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,607 INFO L290 TraceCheckUtils]: 133: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,607 INFO L290 TraceCheckUtils]: 134: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,607 INFO L290 TraceCheckUtils]: 135: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,608 INFO L290 TraceCheckUtils]: 136: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,608 INFO L290 TraceCheckUtils]: 137: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,608 INFO L290 TraceCheckUtils]: 138: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,608 INFO L290 TraceCheckUtils]: 139: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,609 INFO L290 TraceCheckUtils]: 140: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,609 INFO L290 TraceCheckUtils]: 141: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,609 INFO L290 TraceCheckUtils]: 142: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,609 INFO L290 TraceCheckUtils]: 143: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,609 INFO L290 TraceCheckUtils]: 144: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,610 INFO L290 TraceCheckUtils]: 145: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,610 INFO L290 TraceCheckUtils]: 146: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,610 INFO L290 TraceCheckUtils]: 147: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,610 INFO L290 TraceCheckUtils]: 148: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,611 INFO L290 TraceCheckUtils]: 149: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,611 INFO L290 TraceCheckUtils]: 150: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,611 INFO L290 TraceCheckUtils]: 151: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,611 INFO L290 TraceCheckUtils]: 152: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,612 INFO L290 TraceCheckUtils]: 153: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,612 INFO L290 TraceCheckUtils]: 154: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,612 INFO L290 TraceCheckUtils]: 155: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,612 INFO L290 TraceCheckUtils]: 156: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,612 INFO L290 TraceCheckUtils]: 157: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,613 INFO L290 TraceCheckUtils]: 158: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,613 INFO L290 TraceCheckUtils]: 159: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,613 INFO L290 TraceCheckUtils]: 160: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,613 INFO L290 TraceCheckUtils]: 161: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,614 INFO L290 TraceCheckUtils]: 162: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,614 INFO L290 TraceCheckUtils]: 163: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,614 INFO L290 TraceCheckUtils]: 164: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,614 INFO L290 TraceCheckUtils]: 165: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,614 INFO L290 TraceCheckUtils]: 166: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,615 INFO L290 TraceCheckUtils]: 167: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,615 INFO L290 TraceCheckUtils]: 168: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,615 INFO L290 TraceCheckUtils]: 169: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,615 INFO L290 TraceCheckUtils]: 170: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,616 INFO L290 TraceCheckUtils]: 171: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,616 INFO L290 TraceCheckUtils]: 172: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,616 INFO L290 TraceCheckUtils]: 173: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,616 INFO L290 TraceCheckUtils]: 174: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,617 INFO L290 TraceCheckUtils]: 175: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,617 INFO L290 TraceCheckUtils]: 176: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,617 INFO L290 TraceCheckUtils]: 177: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,617 INFO L290 TraceCheckUtils]: 178: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,617 INFO L290 TraceCheckUtils]: 179: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,618 INFO L290 TraceCheckUtils]: 180: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,618 INFO L290 TraceCheckUtils]: 181: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,618 INFO L290 TraceCheckUtils]: 182: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,618 INFO L290 TraceCheckUtils]: 183: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,619 INFO L290 TraceCheckUtils]: 184: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,619 INFO L290 TraceCheckUtils]: 185: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,619 INFO L290 TraceCheckUtils]: 186: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,619 INFO L290 TraceCheckUtils]: 187: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,620 INFO L290 TraceCheckUtils]: 188: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,620 INFO L290 TraceCheckUtils]: 189: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,620 INFO L290 TraceCheckUtils]: 190: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,620 INFO L290 TraceCheckUtils]: 191: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,620 INFO L290 TraceCheckUtils]: 192: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,621 INFO L290 TraceCheckUtils]: 193: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,621 INFO L290 TraceCheckUtils]: 194: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,621 INFO L290 TraceCheckUtils]: 195: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,621 INFO L290 TraceCheckUtils]: 196: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,622 INFO L290 TraceCheckUtils]: 197: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,622 INFO L290 TraceCheckUtils]: 198: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,622 INFO L290 TraceCheckUtils]: 199: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,622 INFO L290 TraceCheckUtils]: 200: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,622 INFO L290 TraceCheckUtils]: 201: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,623 INFO L290 TraceCheckUtils]: 202: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,623 INFO L290 TraceCheckUtils]: 203: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,623 INFO L290 TraceCheckUtils]: 204: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,623 INFO L290 TraceCheckUtils]: 205: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,624 INFO L290 TraceCheckUtils]: 206: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,624 INFO L290 TraceCheckUtils]: 207: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,624 INFO L290 TraceCheckUtils]: 208: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,624 INFO L290 TraceCheckUtils]: 209: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,625 INFO L290 TraceCheckUtils]: 210: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,625 INFO L290 TraceCheckUtils]: 211: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,625 INFO L290 TraceCheckUtils]: 212: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,625 INFO L290 TraceCheckUtils]: 213: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,625 INFO L290 TraceCheckUtils]: 214: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,626 INFO L290 TraceCheckUtils]: 215: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,626 INFO L290 TraceCheckUtils]: 216: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,626 INFO L290 TraceCheckUtils]: 217: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,626 INFO L290 TraceCheckUtils]: 218: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,627 INFO L290 TraceCheckUtils]: 219: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,627 INFO L290 TraceCheckUtils]: 220: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,627 INFO L290 TraceCheckUtils]: 221: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,627 INFO L290 TraceCheckUtils]: 222: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,627 INFO L290 TraceCheckUtils]: 223: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,628 INFO L290 TraceCheckUtils]: 224: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,628 INFO L290 TraceCheckUtils]: 225: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,628 INFO L290 TraceCheckUtils]: 226: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,628 INFO L290 TraceCheckUtils]: 227: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,629 INFO L290 TraceCheckUtils]: 228: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,629 INFO L290 TraceCheckUtils]: 229: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,629 INFO L290 TraceCheckUtils]: 230: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,629 INFO L290 TraceCheckUtils]: 231: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,629 INFO L290 TraceCheckUtils]: 232: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,630 INFO L290 TraceCheckUtils]: 233: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,630 INFO L290 TraceCheckUtils]: 234: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,630 INFO L290 TraceCheckUtils]: 235: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,630 INFO L290 TraceCheckUtils]: 236: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,631 INFO L290 TraceCheckUtils]: 237: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,631 INFO L290 TraceCheckUtils]: 238: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,631 INFO L290 TraceCheckUtils]: 239: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,631 INFO L290 TraceCheckUtils]: 240: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,632 INFO L290 TraceCheckUtils]: 241: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,632 INFO L290 TraceCheckUtils]: 242: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,632 INFO L290 TraceCheckUtils]: 243: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,632 INFO L290 TraceCheckUtils]: 244: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,632 INFO L290 TraceCheckUtils]: 245: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,633 INFO L290 TraceCheckUtils]: 246: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,633 INFO L290 TraceCheckUtils]: 247: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,633 INFO L290 TraceCheckUtils]: 248: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,633 INFO L290 TraceCheckUtils]: 249: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,634 INFO L290 TraceCheckUtils]: 250: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,634 INFO L290 TraceCheckUtils]: 251: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,634 INFO L290 TraceCheckUtils]: 252: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,634 INFO L290 TraceCheckUtils]: 253: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,634 INFO L290 TraceCheckUtils]: 254: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,635 INFO L290 TraceCheckUtils]: 255: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,635 INFO L290 TraceCheckUtils]: 256: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,635 INFO L290 TraceCheckUtils]: 257: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,635 INFO L290 TraceCheckUtils]: 258: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,636 INFO L290 TraceCheckUtils]: 259: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,636 INFO L290 TraceCheckUtils]: 260: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,636 INFO L290 TraceCheckUtils]: 261: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,636 INFO L290 TraceCheckUtils]: 262: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,637 INFO L290 TraceCheckUtils]: 263: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,637 INFO L290 TraceCheckUtils]: 264: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,637 INFO L290 TraceCheckUtils]: 265: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,637 INFO L290 TraceCheckUtils]: 266: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,637 INFO L290 TraceCheckUtils]: 267: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,638 INFO L290 TraceCheckUtils]: 268: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,638 INFO L290 TraceCheckUtils]: 269: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,638 INFO L290 TraceCheckUtils]: 270: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,638 INFO L290 TraceCheckUtils]: 271: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,639 INFO L290 TraceCheckUtils]: 272: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,639 INFO L290 TraceCheckUtils]: 273: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,639 INFO L290 TraceCheckUtils]: 274: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,639 INFO L290 TraceCheckUtils]: 275: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,639 INFO L290 TraceCheckUtils]: 276: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,640 INFO L290 TraceCheckUtils]: 277: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,640 INFO L290 TraceCheckUtils]: 278: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,640 INFO L290 TraceCheckUtils]: 279: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,640 INFO L290 TraceCheckUtils]: 280: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,641 INFO L290 TraceCheckUtils]: 281: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,641 INFO L290 TraceCheckUtils]: 282: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,641 INFO L290 TraceCheckUtils]: 283: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,641 INFO L290 TraceCheckUtils]: 284: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,642 INFO L290 TraceCheckUtils]: 285: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,642 INFO L290 TraceCheckUtils]: 286: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,642 INFO L290 TraceCheckUtils]: 287: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,642 INFO L290 TraceCheckUtils]: 288: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,642 INFO L290 TraceCheckUtils]: 289: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,643 INFO L290 TraceCheckUtils]: 290: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,643 INFO L290 TraceCheckUtils]: 291: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,643 INFO L290 TraceCheckUtils]: 292: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,643 INFO L290 TraceCheckUtils]: 293: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,644 INFO L290 TraceCheckUtils]: 294: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,644 INFO L290 TraceCheckUtils]: 295: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,644 INFO L290 TraceCheckUtils]: 296: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,644 INFO L290 TraceCheckUtils]: 297: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,644 INFO L290 TraceCheckUtils]: 298: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,645 INFO L290 TraceCheckUtils]: 299: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,645 INFO L290 TraceCheckUtils]: 300: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,645 INFO L290 TraceCheckUtils]: 301: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,645 INFO L290 TraceCheckUtils]: 302: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,646 INFO L290 TraceCheckUtils]: 303: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,646 INFO L290 TraceCheckUtils]: 304: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,646 INFO L290 TraceCheckUtils]: 305: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,646 INFO L290 TraceCheckUtils]: 306: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,646 INFO L290 TraceCheckUtils]: 307: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,647 INFO L290 TraceCheckUtils]: 308: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,647 INFO L290 TraceCheckUtils]: 309: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,647 INFO L290 TraceCheckUtils]: 310: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,647 INFO L290 TraceCheckUtils]: 311: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,648 INFO L290 TraceCheckUtils]: 312: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,648 INFO L290 TraceCheckUtils]: 313: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,648 INFO L290 TraceCheckUtils]: 314: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,648 INFO L290 TraceCheckUtils]: 315: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,649 INFO L290 TraceCheckUtils]: 316: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,649 INFO L290 TraceCheckUtils]: 317: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,649 INFO L290 TraceCheckUtils]: 318: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,649 INFO L290 TraceCheckUtils]: 319: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,649 INFO L290 TraceCheckUtils]: 320: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,650 INFO L290 TraceCheckUtils]: 321: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,650 INFO L290 TraceCheckUtils]: 322: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,650 INFO L290 TraceCheckUtils]: 323: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,650 INFO L290 TraceCheckUtils]: 324: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,651 INFO L290 TraceCheckUtils]: 325: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,651 INFO L290 TraceCheckUtils]: 326: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,651 INFO L290 TraceCheckUtils]: 327: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,651 INFO L290 TraceCheckUtils]: 328: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,652 INFO L290 TraceCheckUtils]: 329: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,652 INFO L290 TraceCheckUtils]: 330: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,652 INFO L290 TraceCheckUtils]: 331: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,652 INFO L290 TraceCheckUtils]: 332: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,652 INFO L290 TraceCheckUtils]: 333: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,653 INFO L290 TraceCheckUtils]: 334: Hoare triple {59027#(< 19 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,653 INFO L290 TraceCheckUtils]: 335: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,653 INFO L290 TraceCheckUtils]: 336: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,653 INFO L290 TraceCheckUtils]: 337: Hoare triple {59027#(< 19 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,654 INFO L290 TraceCheckUtils]: 338: Hoare triple {59027#(< 19 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {59027#(< 19 main_~edgecount~0)} is VALID [2022-04-28 09:02:07,654 INFO L290 TraceCheckUtils]: 339: Hoare triple {59027#(< 19 main_~edgecount~0)} ~i~0 := 0; {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:02:07,654 INFO L290 TraceCheckUtils]: 340: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:02:07,655 INFO L290 TraceCheckUtils]: 341: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:02:07,655 INFO L290 TraceCheckUtils]: 342: Hoare triple {59802#(and (<= main_~i~0 0) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:02:07,656 INFO L290 TraceCheckUtils]: 343: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:02:07,656 INFO L290 TraceCheckUtils]: 344: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:02:07,656 INFO L290 TraceCheckUtils]: 345: Hoare triple {59812#(and (< 19 main_~edgecount~0) (<= main_~i~0 1))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:02:07,657 INFO L290 TraceCheckUtils]: 346: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:02:07,657 INFO L290 TraceCheckUtils]: 347: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:02:07,657 INFO L290 TraceCheckUtils]: 348: Hoare triple {59822#(and (< 19 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:02:07,658 INFO L290 TraceCheckUtils]: 349: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:02:07,658 INFO L290 TraceCheckUtils]: 350: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:02:07,658 INFO L290 TraceCheckUtils]: 351: Hoare triple {59832#(and (< 19 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-28 09:02:07,659 INFO L290 TraceCheckUtils]: 352: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-28 09:02:07,659 INFO L290 TraceCheckUtils]: 353: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-28 09:02:07,660 INFO L290 TraceCheckUtils]: 354: Hoare triple {59842#(and (< 19 main_~edgecount~0) (<= main_~i~0 4))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:02:07,660 INFO L290 TraceCheckUtils]: 355: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:02:07,660 INFO L290 TraceCheckUtils]: 356: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} is VALID [2022-04-28 09:02:07,661 INFO L290 TraceCheckUtils]: 357: Hoare triple {59852#(and (<= main_~i~0 5) (< 19 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59862#(and (< 19 main_~edgecount~0) (<= main_~i~0 6))} is VALID [2022-04-28 09:02:07,661 INFO L290 TraceCheckUtils]: 358: Hoare triple {59862#(and (< 19 main_~edgecount~0) (<= main_~i~0 6))} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-28 09:02:07,661 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-28 09:02:07,661 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-28 09:02:07,661 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-28 09:02:07,661 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-28 09:02:07,661 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-28 09:02:07,661 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-28 09:02:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 537 proven. 4829 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-28 09:02:07,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:08,947 INFO L290 TraceCheckUtils]: 364: Hoare triple {58748#false} assume !false; {58748#false} is VALID [2022-04-28 09:02:08,948 INFO L290 TraceCheckUtils]: 363: Hoare triple {58748#false} assume 0 == ~cond; {58748#false} is VALID [2022-04-28 09:02:08,948 INFO L290 TraceCheckUtils]: 362: Hoare triple {58748#false} ~cond := #in~cond; {58748#false} is VALID [2022-04-28 09:02:08,948 INFO L272 TraceCheckUtils]: 361: Hoare triple {58748#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {58748#false} is VALID [2022-04-28 09:02:08,948 INFO L290 TraceCheckUtils]: 360: Hoare triple {58748#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58748#false} is VALID [2022-04-28 09:02:08,948 INFO L290 TraceCheckUtils]: 359: Hoare triple {58748#false} ~i~0 := 0; {58748#false} is VALID [2022-04-28 09:02:08,948 INFO L290 TraceCheckUtils]: 358: Hoare triple {59902#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {58748#false} is VALID [2022-04-28 09:02:08,949 INFO L290 TraceCheckUtils]: 357: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59902#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,949 INFO L290 TraceCheckUtils]: 356: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,949 INFO L290 TraceCheckUtils]: 355: Hoare triple {59906#(< (+ main_~i~0 1) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,949 INFO L290 TraceCheckUtils]: 354: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59906#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,950 INFO L290 TraceCheckUtils]: 353: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,950 INFO L290 TraceCheckUtils]: 352: Hoare triple {59916#(< (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,950 INFO L290 TraceCheckUtils]: 351: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59916#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,950 INFO L290 TraceCheckUtils]: 350: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,951 INFO L290 TraceCheckUtils]: 349: Hoare triple {59926#(< (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,951 INFO L290 TraceCheckUtils]: 348: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59926#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,951 INFO L290 TraceCheckUtils]: 347: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,951 INFO L290 TraceCheckUtils]: 346: Hoare triple {59936#(< (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,952 INFO L290 TraceCheckUtils]: 345: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59936#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,952 INFO L290 TraceCheckUtils]: 344: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,952 INFO L290 TraceCheckUtils]: 343: Hoare triple {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,953 INFO L290 TraceCheckUtils]: 342: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {59946#(< (+ 5 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,953 INFO L290 TraceCheckUtils]: 341: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,953 INFO L290 TraceCheckUtils]: 340: Hoare triple {59956#(< (+ main_~i~0 6) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,954 INFO L290 TraceCheckUtils]: 339: Hoare triple {59966#(< 6 main_~edgecount~0)} ~i~0 := 0; {59956#(< (+ main_~i~0 6) main_~edgecount~0)} is VALID [2022-04-28 09:02:08,954 INFO L290 TraceCheckUtils]: 338: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,954 INFO L290 TraceCheckUtils]: 337: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,954 INFO L290 TraceCheckUtils]: 336: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,955 INFO L290 TraceCheckUtils]: 335: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,955 INFO L290 TraceCheckUtils]: 334: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,955 INFO L290 TraceCheckUtils]: 333: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,955 INFO L290 TraceCheckUtils]: 332: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,955 INFO L290 TraceCheckUtils]: 331: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,956 INFO L290 TraceCheckUtils]: 330: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,956 INFO L290 TraceCheckUtils]: 329: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,956 INFO L290 TraceCheckUtils]: 328: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,956 INFO L290 TraceCheckUtils]: 327: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,957 INFO L290 TraceCheckUtils]: 326: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,957 INFO L290 TraceCheckUtils]: 325: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,957 INFO L290 TraceCheckUtils]: 324: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,957 INFO L290 TraceCheckUtils]: 323: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,958 INFO L290 TraceCheckUtils]: 322: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,958 INFO L290 TraceCheckUtils]: 321: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,958 INFO L290 TraceCheckUtils]: 320: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,958 INFO L290 TraceCheckUtils]: 319: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,958 INFO L290 TraceCheckUtils]: 318: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,959 INFO L290 TraceCheckUtils]: 317: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,959 INFO L290 TraceCheckUtils]: 316: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,959 INFO L290 TraceCheckUtils]: 315: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,959 INFO L290 TraceCheckUtils]: 314: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,960 INFO L290 TraceCheckUtils]: 313: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,960 INFO L290 TraceCheckUtils]: 312: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,960 INFO L290 TraceCheckUtils]: 311: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,960 INFO L290 TraceCheckUtils]: 310: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,960 INFO L290 TraceCheckUtils]: 309: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,961 INFO L290 TraceCheckUtils]: 308: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,961 INFO L290 TraceCheckUtils]: 307: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,961 INFO L290 TraceCheckUtils]: 306: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,961 INFO L290 TraceCheckUtils]: 305: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,962 INFO L290 TraceCheckUtils]: 304: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,962 INFO L290 TraceCheckUtils]: 303: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,962 INFO L290 TraceCheckUtils]: 302: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,962 INFO L290 TraceCheckUtils]: 301: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,962 INFO L290 TraceCheckUtils]: 300: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,963 INFO L290 TraceCheckUtils]: 299: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,963 INFO L290 TraceCheckUtils]: 298: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,963 INFO L290 TraceCheckUtils]: 297: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,963 INFO L290 TraceCheckUtils]: 296: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,964 INFO L290 TraceCheckUtils]: 295: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,964 INFO L290 TraceCheckUtils]: 294: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,964 INFO L290 TraceCheckUtils]: 293: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,964 INFO L290 TraceCheckUtils]: 292: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,965 INFO L290 TraceCheckUtils]: 291: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,965 INFO L290 TraceCheckUtils]: 290: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,965 INFO L290 TraceCheckUtils]: 289: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,965 INFO L290 TraceCheckUtils]: 288: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,965 INFO L290 TraceCheckUtils]: 287: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,966 INFO L290 TraceCheckUtils]: 286: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,966 INFO L290 TraceCheckUtils]: 285: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,966 INFO L290 TraceCheckUtils]: 284: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,966 INFO L290 TraceCheckUtils]: 283: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,967 INFO L290 TraceCheckUtils]: 282: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,967 INFO L290 TraceCheckUtils]: 281: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,967 INFO L290 TraceCheckUtils]: 280: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,967 INFO L290 TraceCheckUtils]: 279: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,967 INFO L290 TraceCheckUtils]: 278: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,968 INFO L290 TraceCheckUtils]: 277: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,968 INFO L290 TraceCheckUtils]: 276: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,968 INFO L290 TraceCheckUtils]: 275: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,968 INFO L290 TraceCheckUtils]: 274: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,969 INFO L290 TraceCheckUtils]: 273: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,969 INFO L290 TraceCheckUtils]: 272: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,969 INFO L290 TraceCheckUtils]: 271: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,969 INFO L290 TraceCheckUtils]: 270: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,969 INFO L290 TraceCheckUtils]: 269: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,970 INFO L290 TraceCheckUtils]: 268: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,970 INFO L290 TraceCheckUtils]: 267: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,970 INFO L290 TraceCheckUtils]: 266: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,970 INFO L290 TraceCheckUtils]: 265: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,971 INFO L290 TraceCheckUtils]: 264: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,971 INFO L290 TraceCheckUtils]: 263: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,971 INFO L290 TraceCheckUtils]: 262: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,971 INFO L290 TraceCheckUtils]: 261: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,972 INFO L290 TraceCheckUtils]: 260: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,972 INFO L290 TraceCheckUtils]: 259: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,972 INFO L290 TraceCheckUtils]: 258: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,972 INFO L290 TraceCheckUtils]: 257: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,972 INFO L290 TraceCheckUtils]: 256: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,973 INFO L290 TraceCheckUtils]: 255: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,973 INFO L290 TraceCheckUtils]: 254: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,973 INFO L290 TraceCheckUtils]: 253: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,973 INFO L290 TraceCheckUtils]: 252: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,974 INFO L290 TraceCheckUtils]: 251: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,974 INFO L290 TraceCheckUtils]: 250: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,974 INFO L290 TraceCheckUtils]: 249: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,974 INFO L290 TraceCheckUtils]: 248: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,975 INFO L290 TraceCheckUtils]: 247: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,975 INFO L290 TraceCheckUtils]: 246: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,975 INFO L290 TraceCheckUtils]: 245: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,975 INFO L290 TraceCheckUtils]: 244: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,975 INFO L290 TraceCheckUtils]: 243: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,976 INFO L290 TraceCheckUtils]: 242: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,976 INFO L290 TraceCheckUtils]: 241: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,976 INFO L290 TraceCheckUtils]: 240: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,976 INFO L290 TraceCheckUtils]: 239: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,977 INFO L290 TraceCheckUtils]: 238: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,977 INFO L290 TraceCheckUtils]: 237: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,977 INFO L290 TraceCheckUtils]: 236: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,977 INFO L290 TraceCheckUtils]: 235: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,977 INFO L290 TraceCheckUtils]: 234: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,978 INFO L290 TraceCheckUtils]: 233: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,978 INFO L290 TraceCheckUtils]: 232: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,978 INFO L290 TraceCheckUtils]: 231: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,978 INFO L290 TraceCheckUtils]: 230: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,979 INFO L290 TraceCheckUtils]: 229: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,979 INFO L290 TraceCheckUtils]: 228: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,979 INFO L290 TraceCheckUtils]: 227: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,979 INFO L290 TraceCheckUtils]: 226: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,980 INFO L290 TraceCheckUtils]: 225: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,980 INFO L290 TraceCheckUtils]: 224: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,980 INFO L290 TraceCheckUtils]: 223: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,980 INFO L290 TraceCheckUtils]: 222: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,980 INFO L290 TraceCheckUtils]: 221: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,981 INFO L290 TraceCheckUtils]: 220: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,981 INFO L290 TraceCheckUtils]: 219: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,981 INFO L290 TraceCheckUtils]: 218: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,981 INFO L290 TraceCheckUtils]: 217: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,982 INFO L290 TraceCheckUtils]: 216: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,982 INFO L290 TraceCheckUtils]: 215: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,982 INFO L290 TraceCheckUtils]: 214: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,982 INFO L290 TraceCheckUtils]: 213: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,983 INFO L290 TraceCheckUtils]: 212: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,983 INFO L290 TraceCheckUtils]: 211: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,983 INFO L290 TraceCheckUtils]: 210: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,983 INFO L290 TraceCheckUtils]: 209: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,983 INFO L290 TraceCheckUtils]: 208: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,984 INFO L290 TraceCheckUtils]: 207: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,984 INFO L290 TraceCheckUtils]: 206: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,984 INFO L290 TraceCheckUtils]: 205: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,984 INFO L290 TraceCheckUtils]: 204: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,985 INFO L290 TraceCheckUtils]: 203: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,985 INFO L290 TraceCheckUtils]: 202: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,985 INFO L290 TraceCheckUtils]: 201: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,985 INFO L290 TraceCheckUtils]: 200: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,986 INFO L290 TraceCheckUtils]: 199: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,986 INFO L290 TraceCheckUtils]: 198: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,986 INFO L290 TraceCheckUtils]: 197: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,986 INFO L290 TraceCheckUtils]: 196: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,986 INFO L290 TraceCheckUtils]: 195: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,987 INFO L290 TraceCheckUtils]: 194: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,987 INFO L290 TraceCheckUtils]: 193: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,987 INFO L290 TraceCheckUtils]: 192: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,987 INFO L290 TraceCheckUtils]: 191: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,988 INFO L290 TraceCheckUtils]: 190: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,988 INFO L290 TraceCheckUtils]: 189: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,988 INFO L290 TraceCheckUtils]: 188: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,988 INFO L290 TraceCheckUtils]: 187: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,988 INFO L290 TraceCheckUtils]: 186: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,989 INFO L290 TraceCheckUtils]: 185: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,989 INFO L290 TraceCheckUtils]: 184: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,989 INFO L290 TraceCheckUtils]: 183: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,989 INFO L290 TraceCheckUtils]: 182: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,990 INFO L290 TraceCheckUtils]: 181: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,990 INFO L290 TraceCheckUtils]: 180: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,990 INFO L290 TraceCheckUtils]: 179: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,990 INFO L290 TraceCheckUtils]: 178: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,991 INFO L290 TraceCheckUtils]: 177: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,991 INFO L290 TraceCheckUtils]: 176: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,991 INFO L290 TraceCheckUtils]: 175: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,991 INFO L290 TraceCheckUtils]: 174: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,991 INFO L290 TraceCheckUtils]: 173: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,992 INFO L290 TraceCheckUtils]: 172: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,992 INFO L290 TraceCheckUtils]: 171: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,992 INFO L290 TraceCheckUtils]: 170: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,992 INFO L290 TraceCheckUtils]: 169: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,993 INFO L290 TraceCheckUtils]: 168: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,993 INFO L290 TraceCheckUtils]: 167: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,993 INFO L290 TraceCheckUtils]: 166: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,993 INFO L290 TraceCheckUtils]: 165: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,993 INFO L290 TraceCheckUtils]: 164: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,994 INFO L290 TraceCheckUtils]: 163: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,994 INFO L290 TraceCheckUtils]: 162: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,994 INFO L290 TraceCheckUtils]: 161: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,994 INFO L290 TraceCheckUtils]: 160: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,995 INFO L290 TraceCheckUtils]: 159: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,995 INFO L290 TraceCheckUtils]: 158: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,995 INFO L290 TraceCheckUtils]: 157: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,995 INFO L290 TraceCheckUtils]: 156: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,995 INFO L290 TraceCheckUtils]: 155: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,996 INFO L290 TraceCheckUtils]: 154: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,996 INFO L290 TraceCheckUtils]: 153: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,996 INFO L290 TraceCheckUtils]: 152: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,996 INFO L290 TraceCheckUtils]: 151: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,997 INFO L290 TraceCheckUtils]: 150: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,997 INFO L290 TraceCheckUtils]: 149: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,997 INFO L290 TraceCheckUtils]: 148: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,997 INFO L290 TraceCheckUtils]: 147: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,998 INFO L290 TraceCheckUtils]: 146: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,998 INFO L290 TraceCheckUtils]: 145: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,998 INFO L290 TraceCheckUtils]: 144: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,998 INFO L290 TraceCheckUtils]: 143: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,998 INFO L290 TraceCheckUtils]: 142: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,999 INFO L290 TraceCheckUtils]: 141: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,999 INFO L290 TraceCheckUtils]: 140: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,999 INFO L290 TraceCheckUtils]: 139: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:08,999 INFO L290 TraceCheckUtils]: 138: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,000 INFO L290 TraceCheckUtils]: 137: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,000 INFO L290 TraceCheckUtils]: 136: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,000 INFO L290 TraceCheckUtils]: 135: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,000 INFO L290 TraceCheckUtils]: 134: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,000 INFO L290 TraceCheckUtils]: 133: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,001 INFO L290 TraceCheckUtils]: 132: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,001 INFO L290 TraceCheckUtils]: 131: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,001 INFO L290 TraceCheckUtils]: 130: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,001 INFO L290 TraceCheckUtils]: 129: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,002 INFO L290 TraceCheckUtils]: 128: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,002 INFO L290 TraceCheckUtils]: 126: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,002 INFO L290 TraceCheckUtils]: 125: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,003 INFO L290 TraceCheckUtils]: 124: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,003 INFO L290 TraceCheckUtils]: 123: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,003 INFO L290 TraceCheckUtils]: 122: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,003 INFO L290 TraceCheckUtils]: 121: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,003 INFO L290 TraceCheckUtils]: 120: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,004 INFO L290 TraceCheckUtils]: 119: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,004 INFO L290 TraceCheckUtils]: 118: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,004 INFO L290 TraceCheckUtils]: 117: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,004 INFO L290 TraceCheckUtils]: 116: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,005 INFO L290 TraceCheckUtils]: 115: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,005 INFO L290 TraceCheckUtils]: 114: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,005 INFO L290 TraceCheckUtils]: 113: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,005 INFO L290 TraceCheckUtils]: 112: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,006 INFO L290 TraceCheckUtils]: 111: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,006 INFO L290 TraceCheckUtils]: 110: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,006 INFO L290 TraceCheckUtils]: 109: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,006 INFO L290 TraceCheckUtils]: 108: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,006 INFO L290 TraceCheckUtils]: 107: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,007 INFO L290 TraceCheckUtils]: 106: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,007 INFO L290 TraceCheckUtils]: 105: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,007 INFO L290 TraceCheckUtils]: 104: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,007 INFO L290 TraceCheckUtils]: 103: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,008 INFO L290 TraceCheckUtils]: 102: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,008 INFO L290 TraceCheckUtils]: 101: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,008 INFO L290 TraceCheckUtils]: 100: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,008 INFO L290 TraceCheckUtils]: 99: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,009 INFO L290 TraceCheckUtils]: 98: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,009 INFO L290 TraceCheckUtils]: 97: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,009 INFO L290 TraceCheckUtils]: 96: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,009 INFO L290 TraceCheckUtils]: 95: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,009 INFO L290 TraceCheckUtils]: 94: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,010 INFO L290 TraceCheckUtils]: 93: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,010 INFO L290 TraceCheckUtils]: 92: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,010 INFO L290 TraceCheckUtils]: 91: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,010 INFO L290 TraceCheckUtils]: 90: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,011 INFO L290 TraceCheckUtils]: 89: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,011 INFO L290 TraceCheckUtils]: 88: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,011 INFO L290 TraceCheckUtils]: 87: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,011 INFO L290 TraceCheckUtils]: 86: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,012 INFO L290 TraceCheckUtils]: 85: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,012 INFO L290 TraceCheckUtils]: 84: Hoare triple {59966#(< 6 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,012 INFO L290 TraceCheckUtils]: 83: Hoare triple {59966#(< 6 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,012 INFO L290 TraceCheckUtils]: 82: Hoare triple {59966#(< 6 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,013 INFO L290 TraceCheckUtils]: 81: Hoare triple {58893#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {59966#(< 6 main_~edgecount~0)} is VALID [2022-04-28 09:02:09,013 INFO L290 TraceCheckUtils]: 80: Hoare triple {58883#(<= 5 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58893#(<= 6 main_~j~0)} is VALID [2022-04-28 09:02:09,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {58883#(<= 5 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58883#(<= 5 main_~j~0)} is VALID [2022-04-28 09:02:09,014 INFO L290 TraceCheckUtils]: 78: Hoare triple {58883#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58883#(<= 5 main_~j~0)} is VALID [2022-04-28 09:02:09,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {58873#(<= 4 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58883#(<= 5 main_~j~0)} is VALID [2022-04-28 09:02:09,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {58873#(<= 4 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58873#(<= 4 main_~j~0)} is VALID [2022-04-28 09:02:09,014 INFO L290 TraceCheckUtils]: 75: Hoare triple {58873#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58873#(<= 4 main_~j~0)} is VALID [2022-04-28 09:02:09,015 INFO L290 TraceCheckUtils]: 74: Hoare triple {58863#(<= 3 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58873#(<= 4 main_~j~0)} is VALID [2022-04-28 09:02:09,015 INFO L290 TraceCheckUtils]: 73: Hoare triple {58863#(<= 3 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58863#(<= 3 main_~j~0)} is VALID [2022-04-28 09:02:09,015 INFO L290 TraceCheckUtils]: 72: Hoare triple {58863#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58863#(<= 3 main_~j~0)} is VALID [2022-04-28 09:02:09,016 INFO L290 TraceCheckUtils]: 71: Hoare triple {58853#(<= 2 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58863#(<= 3 main_~j~0)} is VALID [2022-04-28 09:02:09,016 INFO L290 TraceCheckUtils]: 70: Hoare triple {58853#(<= 2 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58853#(<= 2 main_~j~0)} is VALID [2022-04-28 09:02:09,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {58853#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58853#(<= 2 main_~j~0)} is VALID [2022-04-28 09:02:09,016 INFO L290 TraceCheckUtils]: 68: Hoare triple {58843#(<= 1 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58853#(<= 2 main_~j~0)} is VALID [2022-04-28 09:02:09,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {58843#(<= 1 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58843#(<= 1 main_~j~0)} is VALID [2022-04-28 09:02:09,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {58843#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58843#(<= 1 main_~j~0)} is VALID [2022-04-28 09:02:09,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {58833#(<= 0 main_~j~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58843#(<= 1 main_~j~0)} is VALID [2022-04-28 09:02:09,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {58833#(<= 0 main_~j~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {58833#(<= 0 main_~j~0)} is VALID [2022-04-28 09:02:09,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {58833#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {58833#(<= 0 main_~j~0)} is VALID [2022-04-28 09:02:09,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {58833#(<= 0 main_~j~0)} is VALID [2022-04-28 09:02:09,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:02:09,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {60798#(<= 0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:02:09,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60798#(<= 0 (+ main_~j~0 1))} is VALID [2022-04-28 09:02:09,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:02:09,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {60808#(<= 0 (+ main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:02:09,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60808#(<= 0 (+ main_~j~0 2))} is VALID [2022-04-28 09:02:09,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:02:09,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {60818#(<= 0 (+ main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:02:09,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60818#(<= 0 (+ main_~j~0 3))} is VALID [2022-04-28 09:02:09,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:02:09,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {60828#(<= 0 (+ main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:02:09,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60828#(<= 0 (+ main_~j~0 4))} is VALID [2022-04-28 09:02:09,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:02:09,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {60838#(<= 0 (+ 5 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:02:09,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60838#(<= 0 (+ 5 main_~j~0))} is VALID [2022-04-28 09:02:09,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:02:09,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {60848#(<= 0 (+ main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:02:09,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60848#(<= 0 (+ main_~j~0 6))} is VALID [2022-04-28 09:02:09,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:02:09,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {60858#(<= 0 (+ 7 main_~j~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:02:09,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60858#(<= 0 (+ 7 main_~j~0))} is VALID [2022-04-28 09:02:09,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:02:09,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {60868#(<= 0 (+ main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:02:09,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60868#(<= 0 (+ main_~j~0 8))} is VALID [2022-04-28 09:02:09,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:02:09,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {60878#(<= 0 (+ main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:02:09,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60878#(<= 0 (+ main_~j~0 9))} is VALID [2022-04-28 09:02:09,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:02:09,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {60888#(<= 0 (+ main_~j~0 10))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:02:09,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60888#(<= 0 (+ main_~j~0 10))} is VALID [2022-04-28 09:02:09,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:02:09,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {60898#(<= 0 (+ main_~j~0 11))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:02:09,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60898#(<= 0 (+ main_~j~0 11))} is VALID [2022-04-28 09:02:09,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:02:09,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {60908#(<= 0 (+ main_~j~0 12))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:02:09,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {60908#(<= 0 (+ main_~j~0 12))} is VALID [2022-04-28 09:02:09,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:02:09,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {60918#(<= 0 (+ main_~j~0 13))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:02:09,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {60918#(<= 0 (+ main_~j~0 13))} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {58747#true} ~i~0 := 0; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {58747#true} assume !(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {58747#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {58747#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {58747#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {58747#true} assume !!(~i~0 < ~nodecount~0); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {58747#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {58747#true} call #t~ret22 := main(); {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58747#true} {58747#true} #107#return; {58747#true} is VALID [2022-04-28 09:02:09,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {58747#true} assume true; {58747#true} is VALID [2022-04-28 09:02:09,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {58747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {58747#true} is VALID [2022-04-28 09:02:09,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {58747#true} call ULTIMATE.init(); {58747#true} is VALID [2022-04-28 09:02:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 537 proven. 4829 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2022-04-28 09:02:09,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880601261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:09,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:09,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 30] total 60 [2022-04-28 09:02:09,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:09,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117057058] [2022-04-28 09:02:09,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117057058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:09,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:09,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:02:09,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098852474] [2022-04-28 09:02:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:09,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 365 [2022-04-28 09:02:09,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:09,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:09,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:09,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:02:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:02:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=2668, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 09:02:09,073 INFO L87 Difference]: Start difference. First operand 370 states and 479 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:12,355 INFO L93 Difference]: Finished difference Result 614 states and 798 transitions. [2022-04-28 09:02:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:02:12,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 365 [2022-04-28 09:02:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-28 09:02:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-04-28 09:02:12,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2022-04-28 09:02:12,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:12,501 INFO L225 Difference]: With dead ends: 614 [2022-04-28 09:02:12,501 INFO L226 Difference]: Without dead ends: 603 [2022-04-28 09:02:12,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1053, Invalid=3503, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 09:02:12,502 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 259 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:12,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 42 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:02:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-28 09:02:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 373. [2022-04-28 09:02:14,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:14,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:14,028 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:14,028 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:14,039 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-28 09:02:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-28 09:02:14,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:14,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:14,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-04-28 09:02:14,041 INFO L87 Difference]: Start difference. First operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-04-28 09:02:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:14,052 INFO L93 Difference]: Finished difference Result 603 states and 786 transitions. [2022-04-28 09:02:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 786 transitions. [2022-04-28 09:02:14,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:14,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:14,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:14,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 367 states have (on average 1.2997275204359673) internal successors, (477), 367 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 482 transitions. [2022-04-28 09:02:14,059 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 482 transitions. Word has length 365 [2022-04-28 09:02:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:14,059 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 482 transitions. [2022-04-28 09:02:14,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 373 states and 482 transitions. [2022-04-28 09:02:14,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 482 transitions. [2022-04-28 09:02:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2022-04-28 09:02:14,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:14,883 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:14,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-28 09:02:15,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 09:02:15,084 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 65 times [2022-04-28 09:02:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:15,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1222686456] [2022-04-28 09:02:15,087 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:02:15,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash -382120294, now seen corresponding path program 66 times [2022-04-28 09:02:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:15,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375473583] [2022-04-28 09:02:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:15,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-28 09:02:15,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-28 09:02:15,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-28 09:02:15,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {64195#true} call ULTIMATE.init(); {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:15,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {64209#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-28 09:02:15,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-28 09:02:15,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-28 09:02:15,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-28 09:02:15,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {64195#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {64200#(<= 20 main_~edgecount~0)} ~i~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,410 INFO L290 TraceCheckUtils]: 73: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,410 INFO L290 TraceCheckUtils]: 74: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,410 INFO L290 TraceCheckUtils]: 75: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,410 INFO L290 TraceCheckUtils]: 76: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,411 INFO L290 TraceCheckUtils]: 79: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,411 INFO L290 TraceCheckUtils]: 80: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,412 INFO L290 TraceCheckUtils]: 82: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,412 INFO L290 TraceCheckUtils]: 83: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,412 INFO L290 TraceCheckUtils]: 84: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,412 INFO L290 TraceCheckUtils]: 86: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,413 INFO L290 TraceCheckUtils]: 87: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,413 INFO L290 TraceCheckUtils]: 88: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,413 INFO L290 TraceCheckUtils]: 89: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,413 INFO L290 TraceCheckUtils]: 90: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,413 INFO L290 TraceCheckUtils]: 91: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,414 INFO L290 TraceCheckUtils]: 92: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,414 INFO L290 TraceCheckUtils]: 93: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,414 INFO L290 TraceCheckUtils]: 94: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,414 INFO L290 TraceCheckUtils]: 95: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,415 INFO L290 TraceCheckUtils]: 96: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,415 INFO L290 TraceCheckUtils]: 97: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,415 INFO L290 TraceCheckUtils]: 98: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,415 INFO L290 TraceCheckUtils]: 99: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,415 INFO L290 TraceCheckUtils]: 100: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,416 INFO L290 TraceCheckUtils]: 102: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,416 INFO L290 TraceCheckUtils]: 103: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,416 INFO L290 TraceCheckUtils]: 104: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,416 INFO L290 TraceCheckUtils]: 105: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,417 INFO L290 TraceCheckUtils]: 107: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,417 INFO L290 TraceCheckUtils]: 109: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,418 INFO L290 TraceCheckUtils]: 110: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,418 INFO L290 TraceCheckUtils]: 111: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,418 INFO L290 TraceCheckUtils]: 112: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,418 INFO L290 TraceCheckUtils]: 113: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,418 INFO L290 TraceCheckUtils]: 114: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,419 INFO L290 TraceCheckUtils]: 115: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,419 INFO L290 TraceCheckUtils]: 116: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,419 INFO L290 TraceCheckUtils]: 117: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,419 INFO L290 TraceCheckUtils]: 118: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,419 INFO L290 TraceCheckUtils]: 119: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,420 INFO L290 TraceCheckUtils]: 120: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,420 INFO L290 TraceCheckUtils]: 121: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,420 INFO L290 TraceCheckUtils]: 122: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,420 INFO L290 TraceCheckUtils]: 123: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,420 INFO L290 TraceCheckUtils]: 124: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,421 INFO L290 TraceCheckUtils]: 125: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,421 INFO L290 TraceCheckUtils]: 126: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,421 INFO L290 TraceCheckUtils]: 127: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,421 INFO L290 TraceCheckUtils]: 128: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,421 INFO L290 TraceCheckUtils]: 129: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,422 INFO L290 TraceCheckUtils]: 130: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,422 INFO L290 TraceCheckUtils]: 131: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,422 INFO L290 TraceCheckUtils]: 132: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,422 INFO L290 TraceCheckUtils]: 133: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,422 INFO L290 TraceCheckUtils]: 134: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,423 INFO L290 TraceCheckUtils]: 135: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,423 INFO L290 TraceCheckUtils]: 136: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,423 INFO L290 TraceCheckUtils]: 137: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,423 INFO L290 TraceCheckUtils]: 138: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,423 INFO L290 TraceCheckUtils]: 139: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,424 INFO L290 TraceCheckUtils]: 140: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,424 INFO L290 TraceCheckUtils]: 141: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,424 INFO L290 TraceCheckUtils]: 142: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,424 INFO L290 TraceCheckUtils]: 143: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,424 INFO L290 TraceCheckUtils]: 144: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,425 INFO L290 TraceCheckUtils]: 145: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,425 INFO L290 TraceCheckUtils]: 146: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,425 INFO L290 TraceCheckUtils]: 147: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,425 INFO L290 TraceCheckUtils]: 148: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,425 INFO L290 TraceCheckUtils]: 149: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,426 INFO L290 TraceCheckUtils]: 150: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,426 INFO L290 TraceCheckUtils]: 151: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,426 INFO L290 TraceCheckUtils]: 152: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,426 INFO L290 TraceCheckUtils]: 153: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,426 INFO L290 TraceCheckUtils]: 154: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,427 INFO L290 TraceCheckUtils]: 155: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,427 INFO L290 TraceCheckUtils]: 156: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,427 INFO L290 TraceCheckUtils]: 157: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,427 INFO L290 TraceCheckUtils]: 158: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,427 INFO L290 TraceCheckUtils]: 159: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,428 INFO L290 TraceCheckUtils]: 160: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,428 INFO L290 TraceCheckUtils]: 161: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,428 INFO L290 TraceCheckUtils]: 162: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,428 INFO L290 TraceCheckUtils]: 163: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,428 INFO L290 TraceCheckUtils]: 164: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,429 INFO L290 TraceCheckUtils]: 165: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,429 INFO L290 TraceCheckUtils]: 166: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,429 INFO L290 TraceCheckUtils]: 167: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,429 INFO L290 TraceCheckUtils]: 168: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,429 INFO L290 TraceCheckUtils]: 169: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,430 INFO L290 TraceCheckUtils]: 170: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,430 INFO L290 TraceCheckUtils]: 171: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,430 INFO L290 TraceCheckUtils]: 172: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,430 INFO L290 TraceCheckUtils]: 173: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,430 INFO L290 TraceCheckUtils]: 174: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,431 INFO L290 TraceCheckUtils]: 175: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,431 INFO L290 TraceCheckUtils]: 176: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,431 INFO L290 TraceCheckUtils]: 177: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,431 INFO L290 TraceCheckUtils]: 178: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,431 INFO L290 TraceCheckUtils]: 179: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,432 INFO L290 TraceCheckUtils]: 180: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,432 INFO L290 TraceCheckUtils]: 181: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,432 INFO L290 TraceCheckUtils]: 182: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,432 INFO L290 TraceCheckUtils]: 183: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,432 INFO L290 TraceCheckUtils]: 184: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,433 INFO L290 TraceCheckUtils]: 185: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,433 INFO L290 TraceCheckUtils]: 186: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,433 INFO L290 TraceCheckUtils]: 187: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,433 INFO L290 TraceCheckUtils]: 188: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,433 INFO L290 TraceCheckUtils]: 189: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,434 INFO L290 TraceCheckUtils]: 190: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,434 INFO L290 TraceCheckUtils]: 191: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,434 INFO L290 TraceCheckUtils]: 192: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,434 INFO L290 TraceCheckUtils]: 193: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,434 INFO L290 TraceCheckUtils]: 194: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,435 INFO L290 TraceCheckUtils]: 195: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,435 INFO L290 TraceCheckUtils]: 196: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,435 INFO L290 TraceCheckUtils]: 197: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,435 INFO L290 TraceCheckUtils]: 198: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,435 INFO L290 TraceCheckUtils]: 199: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,436 INFO L290 TraceCheckUtils]: 200: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,436 INFO L290 TraceCheckUtils]: 201: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,436 INFO L290 TraceCheckUtils]: 202: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,436 INFO L290 TraceCheckUtils]: 203: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,436 INFO L290 TraceCheckUtils]: 204: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,437 INFO L290 TraceCheckUtils]: 205: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,437 INFO L290 TraceCheckUtils]: 206: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,437 INFO L290 TraceCheckUtils]: 207: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,437 INFO L290 TraceCheckUtils]: 208: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,437 INFO L290 TraceCheckUtils]: 209: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,438 INFO L290 TraceCheckUtils]: 210: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,438 INFO L290 TraceCheckUtils]: 211: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,438 INFO L290 TraceCheckUtils]: 212: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,438 INFO L290 TraceCheckUtils]: 213: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,438 INFO L290 TraceCheckUtils]: 214: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,439 INFO L290 TraceCheckUtils]: 215: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,439 INFO L290 TraceCheckUtils]: 216: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,439 INFO L290 TraceCheckUtils]: 217: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,439 INFO L290 TraceCheckUtils]: 218: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,439 INFO L290 TraceCheckUtils]: 219: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,440 INFO L290 TraceCheckUtils]: 220: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,440 INFO L290 TraceCheckUtils]: 221: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,440 INFO L290 TraceCheckUtils]: 222: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,440 INFO L290 TraceCheckUtils]: 223: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,440 INFO L290 TraceCheckUtils]: 224: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,441 INFO L290 TraceCheckUtils]: 225: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,441 INFO L290 TraceCheckUtils]: 226: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,441 INFO L290 TraceCheckUtils]: 227: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,441 INFO L290 TraceCheckUtils]: 228: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,441 INFO L290 TraceCheckUtils]: 229: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,442 INFO L290 TraceCheckUtils]: 230: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,442 INFO L290 TraceCheckUtils]: 231: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,442 INFO L290 TraceCheckUtils]: 232: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,442 INFO L290 TraceCheckUtils]: 233: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,442 INFO L290 TraceCheckUtils]: 234: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,443 INFO L290 TraceCheckUtils]: 235: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,443 INFO L290 TraceCheckUtils]: 236: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,443 INFO L290 TraceCheckUtils]: 237: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,443 INFO L290 TraceCheckUtils]: 238: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,443 INFO L290 TraceCheckUtils]: 239: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,444 INFO L290 TraceCheckUtils]: 240: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,444 INFO L290 TraceCheckUtils]: 241: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,444 INFO L290 TraceCheckUtils]: 242: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,444 INFO L290 TraceCheckUtils]: 243: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,444 INFO L290 TraceCheckUtils]: 244: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,445 INFO L290 TraceCheckUtils]: 245: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,445 INFO L290 TraceCheckUtils]: 246: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,445 INFO L290 TraceCheckUtils]: 247: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,445 INFO L290 TraceCheckUtils]: 248: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,445 INFO L290 TraceCheckUtils]: 249: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,446 INFO L290 TraceCheckUtils]: 250: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,446 INFO L290 TraceCheckUtils]: 251: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,446 INFO L290 TraceCheckUtils]: 252: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,446 INFO L290 TraceCheckUtils]: 253: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,446 INFO L290 TraceCheckUtils]: 254: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,447 INFO L290 TraceCheckUtils]: 255: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,447 INFO L290 TraceCheckUtils]: 256: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,447 INFO L290 TraceCheckUtils]: 257: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,447 INFO L290 TraceCheckUtils]: 258: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,447 INFO L290 TraceCheckUtils]: 259: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,448 INFO L290 TraceCheckUtils]: 260: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,448 INFO L290 TraceCheckUtils]: 261: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,448 INFO L290 TraceCheckUtils]: 262: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,448 INFO L290 TraceCheckUtils]: 263: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,448 INFO L290 TraceCheckUtils]: 264: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,449 INFO L290 TraceCheckUtils]: 265: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,449 INFO L290 TraceCheckUtils]: 266: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,449 INFO L290 TraceCheckUtils]: 267: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,449 INFO L290 TraceCheckUtils]: 268: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,449 INFO L290 TraceCheckUtils]: 269: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,450 INFO L290 TraceCheckUtils]: 270: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,450 INFO L290 TraceCheckUtils]: 271: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,450 INFO L290 TraceCheckUtils]: 272: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,450 INFO L290 TraceCheckUtils]: 273: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,450 INFO L290 TraceCheckUtils]: 274: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,451 INFO L290 TraceCheckUtils]: 275: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,451 INFO L290 TraceCheckUtils]: 276: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,451 INFO L290 TraceCheckUtils]: 277: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,451 INFO L290 TraceCheckUtils]: 278: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,451 INFO L290 TraceCheckUtils]: 279: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,452 INFO L290 TraceCheckUtils]: 280: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,452 INFO L290 TraceCheckUtils]: 281: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,452 INFO L290 TraceCheckUtils]: 282: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,452 INFO L290 TraceCheckUtils]: 283: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,452 INFO L290 TraceCheckUtils]: 284: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,453 INFO L290 TraceCheckUtils]: 285: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,453 INFO L290 TraceCheckUtils]: 286: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,453 INFO L290 TraceCheckUtils]: 287: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,453 INFO L290 TraceCheckUtils]: 288: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,453 INFO L290 TraceCheckUtils]: 289: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,454 INFO L290 TraceCheckUtils]: 290: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,454 INFO L290 TraceCheckUtils]: 291: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,454 INFO L290 TraceCheckUtils]: 292: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,454 INFO L290 TraceCheckUtils]: 293: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,454 INFO L290 TraceCheckUtils]: 294: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,455 INFO L290 TraceCheckUtils]: 295: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,455 INFO L290 TraceCheckUtils]: 296: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,455 INFO L290 TraceCheckUtils]: 297: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,455 INFO L290 TraceCheckUtils]: 298: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,455 INFO L290 TraceCheckUtils]: 299: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,456 INFO L290 TraceCheckUtils]: 300: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,456 INFO L290 TraceCheckUtils]: 301: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,456 INFO L290 TraceCheckUtils]: 302: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,456 INFO L290 TraceCheckUtils]: 303: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,456 INFO L290 TraceCheckUtils]: 304: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,457 INFO L290 TraceCheckUtils]: 305: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,457 INFO L290 TraceCheckUtils]: 306: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,457 INFO L290 TraceCheckUtils]: 307: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,457 INFO L290 TraceCheckUtils]: 308: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,457 INFO L290 TraceCheckUtils]: 309: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,458 INFO L290 TraceCheckUtils]: 310: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,458 INFO L290 TraceCheckUtils]: 311: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,458 INFO L290 TraceCheckUtils]: 312: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,458 INFO L290 TraceCheckUtils]: 313: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,458 INFO L290 TraceCheckUtils]: 314: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,459 INFO L290 TraceCheckUtils]: 315: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,459 INFO L290 TraceCheckUtils]: 316: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,459 INFO L290 TraceCheckUtils]: 317: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,459 INFO L290 TraceCheckUtils]: 318: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,459 INFO L290 TraceCheckUtils]: 319: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,460 INFO L290 TraceCheckUtils]: 320: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,460 INFO L290 TraceCheckUtils]: 321: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,460 INFO L290 TraceCheckUtils]: 322: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,460 INFO L290 TraceCheckUtils]: 323: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,460 INFO L290 TraceCheckUtils]: 324: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,461 INFO L290 TraceCheckUtils]: 325: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,461 INFO L290 TraceCheckUtils]: 326: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,461 INFO L290 TraceCheckUtils]: 327: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,461 INFO L290 TraceCheckUtils]: 328: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,461 INFO L290 TraceCheckUtils]: 329: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,462 INFO L290 TraceCheckUtils]: 330: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,462 INFO L290 TraceCheckUtils]: 331: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,462 INFO L290 TraceCheckUtils]: 332: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,462 INFO L290 TraceCheckUtils]: 333: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,462 INFO L290 TraceCheckUtils]: 334: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,463 INFO L290 TraceCheckUtils]: 335: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,463 INFO L290 TraceCheckUtils]: 336: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,463 INFO L290 TraceCheckUtils]: 337: Hoare triple {64200#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,463 INFO L290 TraceCheckUtils]: 338: Hoare triple {64200#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {64200#(<= 20 main_~edgecount~0)} is VALID [2022-04-28 09:02:15,464 INFO L290 TraceCheckUtils]: 339: Hoare triple {64200#(<= 20 main_~edgecount~0)} ~i~0 := 0; {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:02:15,464 INFO L290 TraceCheckUtils]: 340: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:02:15,464 INFO L290 TraceCheckUtils]: 341: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-28 09:02:15,465 INFO L290 TraceCheckUtils]: 342: Hoare triple {64201#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,465 INFO L290 TraceCheckUtils]: 343: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,465 INFO L290 TraceCheckUtils]: 344: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,466 INFO L290 TraceCheckUtils]: 345: Hoare triple {64202#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,466 INFO L290 TraceCheckUtils]: 346: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,466 INFO L290 TraceCheckUtils]: 347: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,466 INFO L290 TraceCheckUtils]: 348: Hoare triple {64203#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,466 INFO L290 TraceCheckUtils]: 349: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,467 INFO L290 TraceCheckUtils]: 350: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,467 INFO L290 TraceCheckUtils]: 351: Hoare triple {64204#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,467 INFO L290 TraceCheckUtils]: 352: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,467 INFO L290 TraceCheckUtils]: 353: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,468 INFO L290 TraceCheckUtils]: 354: Hoare triple {64205#(<= (+ main_~i~0 16) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,468 INFO L290 TraceCheckUtils]: 355: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,468 INFO L290 TraceCheckUtils]: 356: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,468 INFO L290 TraceCheckUtils]: 357: Hoare triple {64206#(<= (+ main_~i~0 15) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,469 INFO L290 TraceCheckUtils]: 358: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,469 INFO L290 TraceCheckUtils]: 359: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,469 INFO L290 TraceCheckUtils]: 360: Hoare triple {64207#(<= (+ main_~i~0 14) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64208#(<= (+ main_~i~0 13) main_~edgecount~0)} is VALID [2022-04-28 09:02:15,470 INFO L290 TraceCheckUtils]: 361: Hoare triple {64208#(<= (+ main_~i~0 13) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {64196#false} is VALID [2022-04-28 09:02:15,470 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-28 09:02:15,470 INFO L290 TraceCheckUtils]: 363: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:15,470 INFO L272 TraceCheckUtils]: 364: Hoare triple {64196#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {64196#false} is VALID [2022-04-28 09:02:15,470 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-28 09:02:15,470 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-28 09:02:15,470 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-28 09:02:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15490 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-28 09:02:15,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375473583] [2022-04-28 09:02:15,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375473583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208779960] [2022-04-28 09:02:15,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:02:15,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:15,472 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:02:15,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 09:02:26,029 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 09:02:26,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:26,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 09:02:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:26,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:26,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-04-28 09:02:26,331 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-28 09:02:26,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-28 09:02:26,528 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-28 09:02:26,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-28 09:02:26,666 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-28 09:02:26,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-04-28 09:02:26,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:26,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:26,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:26,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:26,858 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-28 09:02:26,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 58 [2022-04-28 09:02:27,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:27,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:27,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:27,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:27,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:27,195 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-28 09:02:27,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 73 [2022-04-28 09:02:29,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:29,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:29,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:29,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:29,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:29,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:29,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:29,385 INFO L356 Elim1Store]: treesize reduction 99, result has 19.5 percent of original size [2022-04-28 09:02:29,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 91 [2022-04-28 09:02:30,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:30,114 INFO L356 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2022-04-28 09:02:30,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 61 [2022-04-28 09:02:30,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {64195#true} call ULTIMATE.init(); {64195#true} is VALID [2022-04-28 09:02:30,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {64195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {64195#true} is VALID [2022-04-28 09:02:30,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {64195#true} assume true; {64195#true} is VALID [2022-04-28 09:02:30,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64195#true} {64195#true} #107#return; {64195#true} is VALID [2022-04-28 09:02:30,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {64195#true} call #t~ret22 := main(); {64195#true} is VALID [2022-04-28 09:02:30,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {64195#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {64228#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {64238#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64263#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {64263#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64267#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {64267#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {64271#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {64271#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) ~INFINITY~0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64275#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {64275#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (< main_~i~0 main_~nodecount~0) (= |main_~#Source~0.offset| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {64279#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (<= main_~i~0 (+ v_main_~i~0_542 1)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (< v_main_~i~0_542 main_~nodecount~0))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {64279#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (<= main_~i~0 (+ v_main_~i~0_542 1)) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (< v_main_~i~0_542 main_~nodecount~0))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (= 5 main_~nodecount~0) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} ~i~0 := 0; {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {64283#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64294#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0) (<= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))))} is VALID [2022-04-28 09:02:30,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {64294#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0) (<= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {64290#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64301#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= main_~j~0 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-28 09:02:30,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {64301#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= main_~j~0 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (exists ((v_main_~i~0_542 Int)) (and (< v_main_~i~0_542 5) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_542))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_542)))) (<= 4 v_main_~i~0_542))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 4)) 4) (<= 1 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 4 |main_~#Weight~0.offset|))) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64305#(and (<= |main_#t~mem11| |main_#t~mem9|) (<= 1 |main_#t~mem10|))} is VALID [2022-04-28 09:02:30,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {64305#(and (<= |main_#t~mem11| |main_#t~mem9|) (<= 1 |main_#t~mem10|))} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 73: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 77: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 78: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 80: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 83: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 84: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 85: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 86: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 88: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 89: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 90: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 94: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 95: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 97: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 98: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 99: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 100: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 101: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 102: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 103: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 104: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 105: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 106: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 107: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 108: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 109: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 110: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 111: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 112: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 113: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 115: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 116: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 117: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 118: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 119: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 120: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 121: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 122: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 123: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 124: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 125: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 126: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 127: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 128: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 129: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 130: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 131: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 132: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 133: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 134: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 135: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,937 INFO L290 TraceCheckUtils]: 136: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 137: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 138: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 139: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 140: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 141: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 142: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 143: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 144: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 145: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 146: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 147: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 148: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 149: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 150: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 151: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 152: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 153: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 154: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 155: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 156: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 157: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,938 INFO L290 TraceCheckUtils]: 158: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 159: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 160: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 161: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 162: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 163: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 164: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 165: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 166: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 167: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 168: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 169: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 170: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 171: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 172: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 173: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 174: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 175: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 176: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 177: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 178: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 179: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,939 INFO L290 TraceCheckUtils]: 180: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 181: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 182: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 183: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 184: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 185: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 186: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 187: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 188: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 189: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 190: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 191: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 192: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 193: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 194: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 195: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 196: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 197: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 198: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 199: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 200: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 201: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,940 INFO L290 TraceCheckUtils]: 202: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 203: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 204: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 205: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 206: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 207: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 208: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 209: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 210: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 211: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 212: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 213: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 214: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 215: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 216: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 217: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 218: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 219: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 220: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 221: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 222: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 223: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,941 INFO L290 TraceCheckUtils]: 224: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 225: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 226: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 227: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 228: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 229: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 230: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 231: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 232: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 233: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 234: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 235: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 236: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 237: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 238: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 239: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 240: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 241: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 242: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 243: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 244: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 245: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,942 INFO L290 TraceCheckUtils]: 246: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 247: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 248: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 249: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 250: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 251: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 252: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 253: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 254: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 255: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 256: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 257: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 258: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 259: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 260: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 261: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 262: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 263: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 264: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 265: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 266: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 267: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,943 INFO L290 TraceCheckUtils]: 268: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 269: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 270: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 271: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 272: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 273: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 274: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 275: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 276: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 277: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 278: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 279: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 280: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 281: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 282: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 283: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 284: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 285: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 286: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 287: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 288: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 289: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,944 INFO L290 TraceCheckUtils]: 290: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 291: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 292: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 293: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 294: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 295: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 296: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 297: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 298: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 299: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 300: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 301: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 302: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 303: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 304: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 305: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 306: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 307: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 308: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 309: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 310: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 311: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,945 INFO L290 TraceCheckUtils]: 312: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 313: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 314: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 315: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 316: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 317: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 318: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 319: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 320: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 321: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 322: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 323: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 324: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 325: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 326: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 327: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 328: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 329: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 330: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 331: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 332: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 333: Hoare triple {64196#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,946 INFO L290 TraceCheckUtils]: 334: Hoare triple {64196#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 335: Hoare triple {64196#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 336: Hoare triple {64196#false} assume !(~j~0 < ~edgecount~0); {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 337: Hoare triple {64196#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 338: Hoare triple {64196#false} assume !(~i~0 < ~nodecount~0); {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 339: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 340: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 341: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 342: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 343: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 344: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 345: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 346: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 347: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 348: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 349: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 350: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 351: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 352: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 353: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 354: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-28 09:02:30,947 INFO L290 TraceCheckUtils]: 355: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 356: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 357: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 358: Hoare triple {64196#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 359: Hoare triple {64196#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 360: Hoare triple {64196#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 361: Hoare triple {64196#false} assume !(~i~0 < ~edgecount~0); {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 362: Hoare triple {64196#false} ~i~0 := 0; {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 363: Hoare triple {64196#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L272 TraceCheckUtils]: 364: Hoare triple {64196#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 365: Hoare triple {64196#false} ~cond := #in~cond; {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 366: Hoare triple {64196#false} assume 0 == ~cond; {64196#false} is VALID [2022-04-28 09:02:30,948 INFO L290 TraceCheckUtils]: 367: Hoare triple {64196#false} assume !false; {64196#false} is VALID [2022-04-28 09:02:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15490 backedges. 519 proven. 17 refuted. 0 times theorem prover too weak. 14954 trivial. 0 not checked. [2022-04-28 09:02:30,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:34,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_1176 Int)) (or (not (<= v_main_~x~0_1176 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)))) (forall ((v_ArrVal_6099 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse2 (* c_main_~j~0 4))) (<= (select .cse0 (+ (* 4 (select (select .cse1 |c_main_~#Dest~0.base|) (+ .cse2 4 |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|)) (+ (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse2 4)) 4) |c_main_~#distance~0.offset|)) (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse2 4))))))))) is different from false [2022-04-28 09:02:35,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_1176 Int) (v_ArrVal_6099 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) (+ 4 |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|)) (+ (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 4)) (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 4)) 4) |c_main_~#distance~0.offset|)))))) (not (<= v_main_~x~0_1176 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))))) is different from false [2022-04-28 09:02:49,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_main_~nodecount~0)) (< (+ main_~i~0 2) c_main_~nodecount~0) (forall ((v_ArrVal_6098 Int) (v_ArrVal_6096 Int) (v_main_~x~0_1176 Int) (v_ArrVal_6099 Int)) (let ((.cse2 (let ((.cse3 (* main_~i~0 4))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| .cse3) v_ArrVal_6096) (+ 4 |c_main_~#distance~0.offset| .cse3) v_ArrVal_6098)))) (or (let ((.cse0 (store .cse2 (+ (* v_main_~x~0_1176 4) |c_main_~#distance~0.offset|) v_ArrVal_6099))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) (+ 4 |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|)) (+ (select (select .cse1 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 4)) (select .cse0 (+ (* 4 (select (select .cse1 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 4))) |c_main_~#distance~0.offset|)))))) (not (<= v_main_~x~0_1176 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))) (not (<= c_~INFINITY~0 v_ArrVal_6098)) (not (<= v_ArrVal_6096 c_~INFINITY~0))))))) is different from false [2022-04-28 09:02:59,755 INFO L356 Elim1Store]: treesize reduction 414, result has 23.8 percent of original size [2022-04-28 09:02:59,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 34154 treesize of output 15154